%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET807+4 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:48:37 PM UTC 2026
% Result : Theorem 0.57s 1.22s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 66 ( 7 unt; 1 def)
% Number of atoms : 275 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 223 ( 80 ~; 74 |; 53 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 133 ( 0 sgn 112 !; 21 ?; 38 :)
% 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(f16,axiom,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+2.ax',pre_order) ).
fof(f17,axiom,
! [X0,X1] :
( apply(subset_predicate,X0,X1)
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rel_subset) ).
fof(f18,conjecture,
! [X0] : pre_order(subset_predicate,power_set(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV18a) ).
fof(f19,negated_conjecture,
~ ! [X0] : pre_order(subset_predicate,power_set(X0)),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X3,X4,X5] :
( ( member(X5,X1)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X4) )
=> apply(X0,X3,X5) ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
inference(rectify,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ( ! [X3,X4,X5] :
( ( member(X5,X1)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X4) )
=> apply(X0,X3,X5) ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) )
=> pre_order(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f22,plain,
? [X0] : ~ pre_order(subset_predicate,power_set(X0)),
inference(ennf_transformation,[],[f19]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X3,X4,X5] :
( member(X5,X1)
& member(X4,X1)
& member(X3,X1)
& apply(X0,X4,X5)
& apply(X0,X3,X4)
& ~ apply(X0,X3,X5) )
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ),
inference(ennf_transformation,[],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X3,X4,X5] :
( member(X5,X1)
& member(X4,X1)
& member(X3,X1)
& apply(X0,X4,X5)
& apply(X0,X3,X4)
& ~ apply(X0,X3,X5) )
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ),
inference(flattening,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ( ~ apply(subset_predicate,X0,X1)
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| apply(subset_predicate,X0,X1) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f29,plain,
~ pre_order(subset_predicate,power_set(sK1)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f22]) ).
fof(f30,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f23]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK2(X0,X1),X0)
& ~ member(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f31]) ).
fof(f37,plain,
! [X0,X1] :
( sP0(X0,X1)
| ( member(sK6(X0,X1),X1)
& ~ apply(X0,sK6(X0,X1),sK6(X0,X1)) )
| pre_order(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(X2,sK6(X0,X1))],[f27]) ).
fof(f38,plain,
! [X0,X1] :
( ~ apply(subset_predicate,X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| apply(subset_predicate,X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f40,plain,
~ pre_order(subset_predicate,power_set(sK1)),
inference(cnf_transformation,[],[f29]) ).
fof(f41,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f42,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f43,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X0,X1] :
( sP0(X0,X1)
| ~ apply(X0,sK6(X0,X1),sK6(X0,X1))
| pre_order(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( apply(subset_predicate,X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ apply(subset_predicate,X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_51,negated_conjecture,
~ pre_order(subset_predicate,power_set(sK1)),
inference(cnf_transformation,[],[f40]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| pre_order(X0,X1)
| ~ apply(X0,sK6(X0,X1),sK6(X0,X1)) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( ~ apply(subset_predicate,X0,X1)
| subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ apply(subset_predicate,X0,X1) ),
inference(renaming,[status(thm)],[c_79]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] :
( apply(subset_predicate,X0,X1)
| ~ subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
tcf(c_220,plain,
( sP0(subset_predicate,power_set(sK1))
| ~ apply(subset_predicate,sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))) ),
inference(resolution,[status(thm)],[c_51,c_63]) ).
tcf(c_256,plain,
( sP0(subset_predicate,power_set(sK1))
| ~ subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))) ),
inference(resolution,[status(thm)],[c_81,c_220]) ).
tcf(c_381,plain,
( subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1)))
| ~ member(sK2(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))),sK6(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_382,plain,
( subset(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK5(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_383,plain,
( subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1)))
| member(sK2(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))),sK6(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_384,plain,
( subset(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
| member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK3(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_398,plain,
! [X0: $i] :
( member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),X0)
| ~ subset(sK3(subset_predicate,power_set(sK1)),X0)
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK3(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_403,plain,
! [X0: $i,X1: $i] :
( member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),X1)
| ~ subset(X0,X1)
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_446,plain,
( member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK4(subset_predicate,power_set(sK1)))
| ~ subset(sK3(subset_predicate,power_set(sK1)),sK4(subset_predicate,power_set(sK1)))
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK3(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_398]) ).
tcf(c_453,plain,
! [X0: $i] :
( member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),X0)
| ~ subset(sK4(subset_predicate,power_set(sK1)),X0)
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK4(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_403]) ).
tcf(c_516,plain,
( member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK5(subset_predicate,power_set(sK1)))
| ~ subset(sK4(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
| ~ member(sK2(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))),sK4(subset_predicate,power_set(sK1))) ),
inference(instantiation,[status(thm)],[c_453]) ).
fof(f26,definition,
! [X0,X1] :
( ~ sP0(X0,X1)
| ? [X3,X4,X5] :
( member(X5,X1)
& member(X4,X1)
& member(X3,X1)
& apply(X0,X4,X5)
& apply(X0,X3,X4)
& ~ apply(X0,X3,X5) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f27,plain,
! [X0,X1] :
( sP0(X0,X1)
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ),
inference(definition_folding,[],[f25,f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ? [X3,X4,X5] :
( member(X5,X1)
& member(X4,X1)
& member(X3,X1)
& apply(X0,X4,X5)
& apply(X0,X3,X4)
& ~ apply(X0,X3,X5) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f35,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ? [X2,X3,X4] :
( member(X4,X1)
& member(X3,X1)
& member(X2,X1)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& ~ apply(X0,X2,X4) ) ),
inference(rectify,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ( member(sK5(X0,X1),X1)
& member(sK4(X0,X1),X1)
& member(sK3(X0,X1),X1)
& apply(X0,sK4(X0,X1),sK5(X0,X1))
& apply(X0,sK3(X0,X1),sK4(X0,X1))
& ~ apply(X0,sK3(X0,X1),sK5(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X2,sK3(X0,X1)),skolemize(X3,sK4(X0,X1)),skolemize(X4,sK5(X0,X1))],[f35]) ).
fof(f49,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| apply(X0,sK4(X0,X1),sK5(X0,X1)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f50,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| apply(X0,sK3(X0,X1),sK4(X0,X1)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f51,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ~ apply(X0,sK3(X0,X1),sK5(X0,X1)) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ~ sP0(X0,X1)
| ~ apply(X0,sK3(X0,X1),sK5(X0,X1)) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( apply(X0,sK3(X0,X1),sK4(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( apply(X0,sK4(X0,X1),sK5(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i] :
( ~ sP0(X0,X1)
| ~ apply(X0,sK3(X0,X1),sK5(X0,X1)) ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] :
( apply(X0,sK3(X0,X1),sK4(X0,X1))
| ~ sP0(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
tcf(c_99,plain,
! [X0: $i,X1: $i] :
( apply(X0,sK4(X0,X1),sK5(X0,X1))
| ~ sP0(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_232,plain,
! [X0: $i] :
( ~ sP0(subset_predicate,X0)
| ~ subset(sK3(subset_predicate,X0),sK5(subset_predicate,X0)) ),
inference(resolution,[status(thm)],[c_81,c_93]) ).
tcf(c_240,plain,
! [X0: $i] :
( subset(sK3(subset_predicate,X0),sK4(subset_predicate,X0))
| ~ sP0(subset_predicate,X0) ),
inference(resolution,[status(thm)],[c_80,c_97]) ).
tcf(c_248,plain,
! [X0: $i] :
( subset(sK4(subset_predicate,X0),sK5(subset_predicate,X0))
| ~ sP0(subset_predicate,X0) ),
inference(resolution,[status(thm)],[c_80,c_99]) ).
tcf(c_313,plain,
( subset(sK4(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1)))
| ~ subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))) ),
inference(resolution,[status(thm)],[c_256,c_248]) ).
tcf(c_320,plain,
( subset(sK3(subset_predicate,power_set(sK1)),sK4(subset_predicate,power_set(sK1)))
| ~ subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1))) ),
inference(resolution,[status(thm)],[c_256,c_240]) ).
tcf(c_327,plain,
( ~ subset(sK6(subset_predicate,power_set(sK1)),sK6(subset_predicate,power_set(sK1)))
| ~ subset(sK3(subset_predicate,power_set(sK1)),sK5(subset_predicate,power_set(sK1))) ),
inference(resolution,[status(thm)],[c_256,c_232]) ).
tcf(c_517,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_516,c_446,c_384,c_383,c_382,c_381,c_327,c_320,c_313]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET807+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 12:03:55 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 0.57/1.22 % SZS status Started for theBenchmark.p
% 0.57/1.22 % SZS status Theorem for theBenchmark.p
% 0.57/1.22
% 0.57/1.22 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.57/1.22
% 0.57/1.22 % ------ iProver source info
% 0.57/1.22
% 0.57/1.22 % git: date: 2026-07-19 20:42:38 +0200
% 0.57/1.22 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.57/1.22 % git: non_committed_changes: false
% 0.57/1.22
% 0.57/1.22 % ------ Parsing...
% 0.57/1.22 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.57/1.22
% 0.57/1.22 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e %
% 0.57/1.22
% 0.57/1.22 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.57/1.22 % ------ Proving...
% 0.57/1.22 % ------ Problem Properties
% 0.57/1.22
% 0.57/1.22 %
% 0.57/1.22 % clauses 17
% 0.57/1.22 % conjectures 0
% 0.57/1.22 % EPR 1
% 0.57/1.22 % Horn 11
% 0.57/1.22 % unary 0
% 0.57/1.22 % binary 16
% 0.57/1.22 % lits 35
% 0.57/1.22 % lits eq 0
% 0.57/1.22 % fd_pure 0
% 0.57/1.22 % fd_pseudo 0
% 0.57/1.22 % fd_cond 0
% 0.57/1.22 % fd_pseudo_cond 0
% 0.57/1.22 % AC symbols 0
% 0.57/1.22
% 0.57/1.22 % ------ Schedule dynamic 5 is on
% 0.57/1.22
% 0.57/1.22 % ------ no conjectures: strip conj schedule
% 0.57/1.22
% 0.57/1.22 % ------ no equalities: superposition off
% 0.57/1.22
% 0.57/1.22 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.57/1.22
% 0.57/1.22
% 0.57/1.22 % ------
% 0.57/1.22 % Current options:
% 0.57/1.22 % ------
% 0.57/1.22
% 0.57/1.22
% 0.57/1.22 %
% 0.57/1.22
% 0.57/1.22 % ------ Proving...
% 0.57/1.22 %
% 0.57/1.22
% 0.57/1.22 % SZS status Theorem for theBenchmark.p
% 0.57/1.22
% 0.57/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.57/1.22
% 0.57/1.22
%------------------------------------------------------------------------------