TSTP Solution File: SET169+4 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET169+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:19:37 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of formulae : 80 ( 16 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 212 ( 91 ~; 89 |; 20 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 82 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f91,plain,
$false,
inference(subsumption_resolution,[],[f90,f85]) ).
fof(f85,plain,
member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK2),
inference(resolution,[],[f84,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X1,X0))
| ~ member(X2,X0)
| ~ member(X2,X1) )
& ( ( member(X2,X0)
& member(X2,X1) )
| ~ member(X2,intersection(X1,X0)) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X0,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X1,X0,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f84,plain,
member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))),
inference(subsumption_resolution,[],[f83,f61]) ).
fof(f61,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(subsumption_resolution,[],[f59,f37]) ).
fof(f59,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f53,f37]) ).
fof(f53,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK3))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1)) ),
inference(resolution,[],[f49,f42]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X1,union(X0,X2))
| member(X1,X2)
| member(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( member(X1,X0)
| member(X1,X2)
| ~ member(X1,union(X0,X2)) )
& ( member(X1,union(X0,X2))
| ( ~ member(X1,X0)
& ~ member(X1,X2) ) ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X2,X1,X0] :
( ( member(X1,X2)
| member(X1,X0)
| ~ member(X1,union(X2,X0)) )
& ( member(X1,union(X2,X0))
| ( ~ member(X1,X2)
& ~ member(X1,X0) ) ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X2,X1,X0] :
( ( member(X1,X2)
| member(X1,X0)
| ~ member(X1,union(X2,X0)) )
& ( member(X1,union(X2,X0))
| ( ~ member(X1,X2)
& ~ member(X1,X0) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X1,X0] :
( ( member(X1,X2)
| member(X1,X0) )
<=> member(X1,union(X2,X0)) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X2,X0] :
( member(X2,union(X0,X1))
<=> ( member(X2,X0)
| member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f49,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f45,f35]) ).
fof(f35,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
| ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
=> ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f45,plain,
( ~ subset(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(resolution,[],[f44,f35]) ).
fof(f44,plain,
( ~ subset(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3)))
| ~ subset(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(resolution,[],[f43,f36]) ).
fof(f36,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
<=> equal_set(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f43,plain,
~ equal_set(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
~ equal_set(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f31,f32]) ).
fof(f32,plain,
( ? [X0,X1,X2] : ~ equal_set(intersection(X1,union(X0,X2)),union(intersection(X1,X0),intersection(X1,X2)))
=> ~ equal_set(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
? [X0,X1,X2] : ~ equal_set(intersection(X1,union(X0,X2)),union(intersection(X1,X0),intersection(X1,X2))),
inference(rectify,[],[f19]) ).
fof(f19,plain,
? [X2,X0,X1] : ~ equal_set(intersection(X0,union(X2,X1)),union(intersection(X0,X2),intersection(X0,X1))),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
~ ! [X1,X2,X0] : equal_set(intersection(X0,union(X2,X1)),union(intersection(X0,X2),intersection(X0,X1))),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X5,X1] : equal_set(intersection(X0,union(X1,X5)),union(intersection(X0,X1),intersection(X0,X5))),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X5,X1] : equal_set(intersection(X0,union(X1,X5)),union(intersection(X0,X1),intersection(X0,X5))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI10) ).
fof(f83,plain,
( member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(duplicate_literal_removal,[],[f82]) ).
fof(f82,plain,
( member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f72,f55]) ).
fof(f55,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK1)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f51,f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X1,union(X0,X2))
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f51,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),union(sK1,sK3))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f47,f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(X2,intersection(X1,X0))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,union(sK1,sK3)))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f46,f35]) ).
fof(f46,plain,
( ~ subset(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f44,f34]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f72,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK1)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f70,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ member(X2,intersection(X1,X0))
| member(X2,X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f70,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(subsumption_resolution,[],[f69,f61]) ).
fof(f69,plain,
( member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1)) ),
inference(duplicate_literal_removal,[],[f68]) ).
fof(f68,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f60,f56]) ).
fof(f56,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK3)
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f51,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X1,union(X0,X2))
| ~ member(X1,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f60,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK3)
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,union(sK1,sK3))) ),
inference(resolution,[],[f53,f38]) ).
fof(f90,plain,
~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK2),
inference(resolution,[],[f89,f79]) ).
fof(f79,plain,
( ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK1)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f77,f39]) ).
fof(f77,plain,
~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,sK1)),
inference(resolution,[],[f76,f41]) ).
fof(f76,plain,
~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))),
inference(subsumption_resolution,[],[f75,f65]) ).
fof(f65,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK1)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f57,f64]) ).
fof(f64,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f62,f37]) ).
fof(f62,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f54,f37]) ).
fof(f54,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK3))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1)) ),
inference(resolution,[],[f50,f42]) ).
fof(f50,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(resolution,[],[f45,f34]) ).
fof(f57,plain,
( ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK1)
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f52,f41]) ).
fof(f52,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),union(sK1,sK3))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2) ),
inference(resolution,[],[f48,f39]) ).
fof(f48,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,union(sK1,sK3)))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(resolution,[],[f46,f34]) ).
fof(f75,plain,
( ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK1) ),
inference(resolution,[],[f73,f38]) ).
fof(f73,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f63,f66]) ).
fof(f66,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK3)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(subsumption_resolution,[],[f58,f64]) ).
fof(f58,plain,
( ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK2)
| ~ member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK3)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3))) ),
inference(resolution,[],[f52,f40]) ).
fof(f63,plain,
( member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),intersection(sK2,sK1))
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(intersection(sK2,sK1),intersection(sK2,sK3)))
| member(sK0(union(intersection(sK2,sK1),intersection(sK2,sK3)),intersection(sK2,union(sK1,sK3))),sK3) ),
inference(resolution,[],[f54,f38]) ).
fof(f89,plain,
member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK1),
inference(subsumption_resolution,[],[f88,f85]) ).
fof(f88,plain,
( member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK1)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f87,f80]) ).
fof(f80,plain,
( ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK3)
| ~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK2) ),
inference(resolution,[],[f78,f39]) ).
fof(f78,plain,
~ member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),intersection(sK2,sK3)),
inference(resolution,[],[f76,f40]) ).
fof(f87,plain,
( member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK3)
| member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),sK1) ),
inference(resolution,[],[f86,f42]) ).
fof(f86,plain,
member(sK0(intersection(sK2,union(sK1,sK3)),union(intersection(sK2,sK1),intersection(sK2,sK3))),union(sK1,sK3)),
inference(resolution,[],[f84,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET169+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 13:49:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (2773)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.50 % (2767)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.51 % (2789)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.51 % (2775)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.51 % (2772)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51 % (2781)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51 % (2775)Refutation not found, incomplete strategy% (2775)------------------------------
% 0.20/0.51 % (2775)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2775)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2775)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (2775)Memory used [KB]: 5884
% 0.20/0.51 % (2775)Time elapsed: 0.103 s
% 0.20/0.51 % (2775)------------------------------
% 0.20/0.51 % (2775)------------------------------
% 0.20/0.51 % (2781)Instruction limit reached!
% 0.20/0.51 % (2781)------------------------------
% 0.20/0.51 % (2781)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2781)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2781)Termination reason: Unknown
% 0.20/0.51 % (2781)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (2781)Memory used [KB]: 6012
% 0.20/0.51 % (2781)Time elapsed: 0.109 s
% 0.20/0.51 % (2781)Instructions burned: 4 (million)
% 0.20/0.51 % (2781)------------------------------
% 0.20/0.51 % (2781)------------------------------
% 0.20/0.51 % (2776)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.51 % (2790)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.51 % (2776)Refutation not found, incomplete strategy% (2776)------------------------------
% 0.20/0.51 % (2776)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2776)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2776)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (2776)Memory used [KB]: 5884
% 0.20/0.51 % (2776)Time elapsed: 0.106 s
% 0.20/0.51 % (2776)------------------------------
% 0.20/0.51 % (2776)------------------------------
% 0.20/0.51 % (2783)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (2790)Refutation not found, incomplete strategy% (2790)------------------------------
% 0.20/0.51 % (2790)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (2790)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (2790)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (2790)Memory used [KB]: 1407
% 0.20/0.51 % (2790)Time elapsed: 0.080 s
% 0.20/0.51 % (2790)Instructions burned: 2 (million)
% 0.20/0.51 % (2790)------------------------------
% 0.20/0.51 % (2790)------------------------------
% 0.20/0.52 % (2769)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (2769)Refutation not found, incomplete strategy% (2769)------------------------------
% 0.20/0.52 % (2769)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (2769)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (2769)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52
% 0.20/0.52 % (2769)Memory used [KB]: 5884
% 0.20/0.52 % (2769)Time elapsed: 0.117 s
% 0.20/0.52 % (2769)Instructions burned: 2 (million)
% 0.20/0.52 % (2769)------------------------------
% 0.20/0.52 % (2769)------------------------------
% 0.20/0.52 % (2774)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (2772)First to succeed.
% 0.20/0.52 % (2777)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.52 % (2778)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (2771)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.53 % (2772)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (2772)------------------------------
% 0.20/0.53 % (2772)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (2772)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (2772)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (2772)Memory used [KB]: 1407
% 0.20/0.53 % (2772)Time elapsed: 0.111 s
% 0.20/0.53 % (2772)Instructions burned: 5 (million)
% 0.20/0.53 % (2772)------------------------------
% 0.20/0.53 % (2772)------------------------------
% 0.20/0.53 % (2766)Success in time 0.171 s
%------------------------------------------------------------------------------