%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET171+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:46:50 PM UTC 2026
% Result : Theorem 1.08s 1.75s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 66 ( 7 unt; 0 def)
% Number of atoms : 164 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 171 ( 73 ~; 77 |; 13 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 104 ( 0 sgn 100 !; 4 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(f12,conjecture,
! [X0,X1,X2] : equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI11) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] : equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f16,plain,
? [X0,X1,X2] : ~ equal_set(union(X0,intersection(X1,X2)),intersection(union(X0,X1),union(X0,X2))),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
~ equal_set(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f16]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( ~ member(X0,intersection(X1,X2))
| ( member(X0,X2)
& member(X0,X1) ) )
& ( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( ~ member(X0,intersection(X1,X2))
| ( member(X0,X2)
& member(X0,X1) ) )
& ( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) )
& ( ( ~ member(X0,X2)
& ~ member(X0,X1) )
| member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) )
& ( ( ~ member(X0,X2)
& ~ member(X0,X1) )
| member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) )
| subset(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f19]) ).
fof(f26,plain,
~ equal_set(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),
inference(cnf_transformation,[],[f20]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f33,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f34,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_49,negated_conjecture,
~ equal_set(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_110,plain,
( ~ subset(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2)))
| ~ subset(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))) ),
inference(resolution,[status(thm)],[c_49,c_56]) ).
tcf(c_159,plain,
( subset(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2))) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_160,plain,
( subset(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2)))
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_161,plain,
( subset(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2)))
| member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,intersection(sK1,sK2))) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_162,plain,
( subset(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2)))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_169,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK0)
| member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(sK1,sK2))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,intersection(sK1,sK2))) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_178,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_179,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(union(sK0,sK1),union(sK0,sK2))) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_182,plain,
! [X0: $i] :
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,X0))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_221,plain,
! [X0: $i,X1: $i] :
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(union(sK0,X0),X1))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),X1)
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,X0)) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_265,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2)
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK2)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_286,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1)
| member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_382,plain,
! [X0: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,X0))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_502,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK2)
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_503,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK1)
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_786,plain,
! [X0: $i] :
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(X0,sK2))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK2) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_789,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK2))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK2) ),
inference(instantiation,[status(thm)],[c_786]) ).
tcf(c_840,plain,
! [X0: $i] :
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(X0,sK1))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_843,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK1))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_840]) ).
tcf(c_1657,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X1,X0))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_1658,plain,
! [X0: $i,X1: $i] :
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(X0,X1))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),X0) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_2040,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),intersection(union(sK0,sK1),union(sK0,sK2)))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK2))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_221]) ).
tcf(c_2687,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_1657]) ).
tcf(c_2715,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),union(sK0,intersection(sK1,sK2)))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_1658]) ).
tcf(c_2755,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK1))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_182]) ).
tcf(c_7404,plain,
( member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),intersection(sK1,sK2))
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK2)
| ~ member(sK3(intersection(union(sK0,sK1),union(sK0,sK2)),union(sK0,intersection(sK1,sK2))),sK1) ),
inference(instantiation,[status(thm)],[c_382]) ).
tcf(c_10936,plain,
( member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),union(sK0,sK2))
| ~ member(sK3(union(sK0,intersection(sK1,sK2)),intersection(union(sK0,sK1),union(sK0,sK2))),sK0) ),
inference(instantiation,[status(thm)],[c_182]) ).
tcf(c_10937,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10936,c_7404,c_2755,c_2715,c_2687,c_2040,c_843,c_789,c_502,c_503,c_286,c_265,c_178,c_179,c_169,c_161,c_162,c_160,c_159,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET171+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 10:08:13 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.08/1.75 % SZS status Started for theBenchmark.p
% 1.08/1.75 % SZS status Theorem for theBenchmark.p
% 1.08/1.75
% 1.08/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.08/1.75
% 1.08/1.75 % ------ iProver source info
% 1.08/1.75
% 1.08/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 1.08/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.08/1.75 % git: non_committed_changes: false
% 1.08/1.75
% 1.08/1.75 % ------ Parsing...
% 1.08/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.08/1.75
% 1.08/1.75 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.08/1.75
% 1.08/1.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.08/1.75 % ------ Proving...
% 1.08/1.75 % ------ Problem Properties
% 1.08/1.75
% 1.08/1.75 %
% 1.08/1.75 % clauses 9
% 1.08/1.75 % conjectures 0
% 1.08/1.75 % EPR 0
% 1.08/1.75 % Horn 7
% 1.08/1.75 % unary 0
% 1.08/1.75 % binary 7
% 1.08/1.75 % lits 20
% 1.08/1.75 % lits eq 0
% 1.08/1.75 % fd_pure 0
% 1.08/1.75 % fd_pseudo 0
% 1.08/1.75 % fd_cond 0
% 1.08/1.75 % fd_pseudo_cond 0
% 1.08/1.75 % AC symbols 0
% 1.08/1.75
% 1.08/1.75 % ------ Schedule dynamic 5 is on
% 1.08/1.75
% 1.08/1.75 % ------ no conjectures: strip conj schedule
% 1.08/1.75
% 1.08/1.75 % ------ no equalities: superposition off
% 1.08/1.75
% 1.08/1.75 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.08/1.75
% 1.08/1.75
% 1.08/1.75 % ------
% 1.08/1.75 % Current options:
% 1.08/1.75 % ------
% 1.08/1.75
% 1.08/1.75
% 1.08/1.75 %
% 1.08/1.75
% 1.08/1.75 % ------ Proving...
% 1.08/1.75 %
% 1.08/1.75
% 1.08/1.75 % SZS status Theorem for theBenchmark.p
% 1.08/1.75
% 1.08/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.08/1.75
% 1.08/1.75
%------------------------------------------------------------------------------