%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET774+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:48:33 PM UTC 2026
% Result : Theorem 3.68s 21.26s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 71 ( 8 unt; 1 def)
% Number of atoms : 314 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 325 ( 124 ~; 134 |; 49 &)
% ( 7 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 153 ( 0 sgn 138 !; 15 ?; 35 :)
% 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,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X0)
& pre_order(X2,X0) )
=> pre_order(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII10) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X0)
& pre_order(X2,X0) )
=> pre_order(X2,X1) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,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(f20,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f21,plain,
? [X0,X1,X2] :
( subset(X1,X0)
& pre_order(X2,X0)
& ~ pre_order(X2,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1,X2] :
( subset(X1,X0)
& pre_order(X2,X0)
& ~ pre_order(X2,X1) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f20]) ).
fof(f24,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(ennf_transformation,[],[f19]) ).
fof(f25,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(flattening,[],[f24]) ).
fof(f28,plain,
( subset(sK2,sK1)
& pre_order(sK3,sK1)
& ~ pre_order(sK3,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).
fof(f32,plain,
! [X0,X1] :
( ( ~ pre_order(X0,X1)
| ( sP0(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| apply(X0,X2,X2) ) ) )
& ( ~ sP0(X0,X1)
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f33,plain,
! [X0,X1] :
( ( ~ pre_order(X0,X1)
| ( sP0(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| apply(X0,X2,X2) ) ) )
& ( ~ sP0(X0,X1)
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( ~ pre_order(X0,X1)
| ( sP0(X0,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X3) ) ) )
& ( ~ sP0(X0,X1)
| ? [X2] :
( member(X2,X1)
& ~ apply(X0,X2,X2) )
| pre_order(X0,X1) ) ),
inference(rectify,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( ~ pre_order(X0,X1)
| ( sP0(X0,X1)
& ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X3) ) ) )
& ( ~ sP0(X0,X1)
| ( member(sK7(X0,X1),X1)
& ~ apply(X0,sK7(X0,X1),sK7(X0,X1)) )
| pre_order(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X2,sK7(X0,X1))],[f34]) ).
fof(f36,plain,
subset(sK2,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f37,plain,
pre_order(sK3,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f38,plain,
~ pre_order(sK3,sK2),
inference(cnf_transformation,[],[f28]) ).
fof(f39,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f47,plain,
! [X0,X1] :
( ~ pre_order(X0,X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f48,plain,
! [X3,X0,X1] :
( ~ pre_order(X0,X1)
| ~ member(X3,X1)
| apply(X0,X3,X3) ),
inference(cnf_transformation,[],[f35]) ).
fof(f49,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| member(sK7(X0,X1),X1)
| pre_order(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f50,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
| pre_order(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_49,negated_conjecture,
~ pre_order(sK3,sK2),
inference(cnf_transformation,[],[f38]) ).
tcf(c_50,negated_conjecture,
pre_order(sK3,sK1),
inference(cnf_transformation,[],[f37]) ).
tcf(c_51,negated_conjecture,
subset(sK2,sK1),
inference(cnf_transformation,[],[f36]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( pre_order(X0,X1)
| ~ sP0(X0,X1)
| ~ apply(X0,sK7(X0,X1),sK7(X0,X1)) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( pre_order(X0,X1)
| member(sK7(X0,X1),X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] :
( apply(X0,X2,X2)
| ~ member(X2,X1)
| ~ pre_order(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| ~ pre_order(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_146,plain,
! [X0: $i] :
( member(X0,sK1)
| ~ member(X0,sK2) ),
inference(resolution,[status(thm)],[c_51,c_52]) ).
tcf(c_186,plain,
( member(sK7(sK3,sK2),sK2)
| ~ sP0(sK3,sK2) ),
inference(resolution,[status(thm)],[c_49,c_61]) ).
tcf(c_193,plain,
( ~ sP0(sK3,sK2)
| ~ apply(sK3,sK7(sK3,sK2),sK7(sK3,sK2)) ),
inference(resolution,[status(thm)],[c_49,c_60]) ).
tcf(c_200,plain,
sP0(sK3,sK1),
inference(resolution,[status(thm)],[c_50,c_63]) ).
tcf(c_1116,plain,
( member(sK7(sK3,sK2),sK1)
| ~ member(sK7(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_146]) ).
tcf(c_1118,plain,
! [X0: $i] :
( apply(X0,sK7(sK3,sK2),sK7(sK3,sK2))
| ~ pre_order(X0,sK1)
| ~ member(sK7(sK3,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_1124,plain,
( apply(sK3,sK7(sK3,sK2),sK7(sK3,sK2))
| ~ pre_order(sK3,sK1)
| ~ member(sK7(sK3,sK2),sK1) ),
inference(instantiation,[status(thm)],[c_1118]) ).
tcf(c_1138,plain,
( member(sK6(sK3,sK2),sK1)
| ~ member(sK6(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_146]) ).
tcf(c_1143,plain,
( member(sK5(sK3,sK2),sK1)
| ~ member(sK5(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_146]) ).
tcf(c_1148,plain,
( member(sK4(sK3,sK2),sK1)
| ~ member(sK4(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_146]) ).
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] :
( pre_order(X0,X1)
<=> ( sP0(X0,X1)
& ! [X2] :
( ~ member(X2,X1)
| apply(X0,X2,X2) ) ) ),
inference(definition_folding,[],[f25,f26]) ).
fof(f29,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) ) )
& ( ? [X3,X4,X5] :
( member(X5,X1)
& member(X4,X1)
& member(X3,X1)
& apply(X0,X4,X5)
& apply(X0,X3,X4)
& ~ apply(X0,X3,X5) )
| sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ( ~ sP0(X0,X1)
| ! [X5,X6,X7] :
( ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| apply(X0,X5,X7) ) )
& ( ? [X2,X3,X4] :
( member(X4,X1)
& member(X3,X1)
& member(X2,X1)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& ~ apply(X0,X2,X4) )
| sP0(X0,X1) ) ),
inference(rectify,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ sP0(X0,X1)
| ! [X5,X6,X7] :
( ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| apply(X0,X5,X7) ) )
& ( ( member(sK6(X0,X1),X1)
& member(sK5(X0,X1),X1)
& member(sK4(X0,X1),X1)
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& apply(X0,sK4(X0,X1),sK5(X0,X1))
& ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) )
| sP0(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X2,sK4(X0,X1)),skolemize(X3,sK5(X0,X1)),skolemize(X4,sK6(X0,X1))],[f30]) ).
fof(f40,plain,
! [X0,X1,X6,X7,X5] :
( ~ sP0(X0,X1)
| ~ member(X7,X1)
| ~ member(X6,X1)
| ~ member(X5,X1)
| ~ apply(X0,X6,X7)
| ~ apply(X0,X5,X6)
| apply(X0,X5,X7) ),
inference(cnf_transformation,[],[f31]) ).
fof(f41,plain,
! [X0,X1] :
( member(sK6(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f42,plain,
! [X0,X1] :
( member(sK5(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f43,plain,
! [X0,X1] :
( member(sK4(X0,X1),X1)
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f44,plain,
! [X0,X1] :
( apply(X0,sK5(X0,X1),sK6(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f45,plain,
! [X0,X1] :
( apply(X0,sK4(X0,X1),sK5(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f46,plain,
! [X0,X1] :
( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
| sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| apply(X0,sK4(X0,X1),sK5(X0,X1)) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| apply(X0,sK5(X0,X1),sK6(X0,X1)) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| member(sK4(X0,X1),X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| member(sK5(X0,X1),X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( sP0(X0,X1)
| member(sK6(X0,X1),X1) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( apply(X0,X1,X3)
| ~ sP0(X0,X4)
| ~ member(X3,X4)
| ~ member(X2,X4)
| ~ member(X1,X4)
| ~ apply(X0,X2,X3)
| ~ apply(X0,X1,X2) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_1099,plain,
( sP0(sK3,sK2)
| apply(sK3,sK5(sK3,sK2),sK6(sK3,sK2)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_1100,plain,
( sP0(sK3,sK2)
| apply(sK3,sK4(sK3,sK2),sK5(sK3,sK2)) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_1101,plain,
( sP0(sK3,sK2)
| ~ apply(sK3,sK4(sK3,sK2),sK6(sK3,sK2)) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_1102,plain,
( sP0(sK3,sK2)
| member(sK6(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_1103,plain,
( sP0(sK3,sK2)
| member(sK5(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_1104,plain,
( sP0(sK3,sK2)
| member(sK4(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_1155,plain,
! [X0: $i,X1: $i,X2: $i] :
( apply(X0,sK4(sK3,sK2),X2)
| ~ sP0(X0,sK1)
| ~ member(X2,sK1)
| ~ member(X1,sK1)
| ~ apply(X0,X1,X2)
| ~ member(sK4(sK3,sK2),sK1)
| ~ apply(X0,sK4(sK3,sK2),X1) ),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_1188,plain,
! [X0: $i] :
( apply(sK3,sK4(sK3,sK2),sK6(sK3,sK2))
| ~ sP0(sK3,sK1)
| ~ member(X0,sK1)
| ~ member(sK6(sK3,sK2),sK1)
| ~ member(sK4(sK3,sK2),sK1)
| ~ apply(sK3,X0,sK6(sK3,sK2))
| ~ apply(sK3,sK4(sK3,sK2),X0) ),
inference(instantiation,[status(thm)],[c_1155]) ).
tcf(c_1191,plain,
( apply(sK3,sK4(sK3,sK2),sK6(sK3,sK2))
| ~ sP0(sK3,sK1)
| ~ member(sK5(sK3,sK2),sK1)
| ~ member(sK6(sK3,sK2),sK1)
| ~ member(sK4(sK3,sK2),sK1)
| ~ apply(sK3,sK5(sK3,sK2),sK6(sK3,sK2))
| ~ apply(sK3,sK4(sK3,sK2),sK5(sK3,sK2)) ),
inference(instantiation,[status(thm)],[c_1188]) ).
tcf(c_1193,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1191,c_1148,c_1143,c_1138,c_1124,c_1116,c_1099,c_1100,c_1101,c_1102,c_1103,c_1104,c_200,c_193,c_186,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET774+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/20.43 % CPULimit : 300
% 0.08/20.43 % WCLimit : 300
% 0.08/20.43 % DateTime : Thu Sep 24 12:00:35 UTC 2026
% 0.08/20.43 % CPUTime :
% 0.08/20.43 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/20.47 Running first-order theorem proving
% 0.08/20.47 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.08/20.48
% 0.08/20.48 % ======== iProver multi-core TPTP/SMT =========
% 0.08/20.48
% 0.08/20.48 % Detected problem language: tptp
% 0.08/20.49 % Proving...
% 3.68/21.26 % SZS status Started for theBenchmark.p
% 3.68/21.26 % SZS status Theorem for theBenchmark.p
% 3.68/21.26
% 3.68/21.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.68/21.26
% 3.68/21.26 % ------ iProver source info
% 3.68/21.26
% 3.68/21.26 % git: date: 2026-07-19 20:42:38 +0200
% 3.68/21.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.68/21.26 % git: non_committed_changes: false
% 3.68/21.26
% 3.68/21.26 % ------ Parsing...
% 3.68/21.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.68/21.26
% 3.68/21.26 % ------ 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 %
% 3.68/21.26
% 3.68/21.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/21.26 % ------ Proving...
% 3.68/21.26 % ------ Problem Properties
% 3.68/21.26
% 3.68/21.26 %
% 3.68/21.26 % clauses 14
% 3.68/21.26 % conjectures 2
% 3.68/21.26 % EPR 6
% 3.68/21.26 % Horn 8
% 3.68/21.26 % unary 2
% 3.68/21.26 % binary 8
% 3.68/21.26 % lits 34
% 3.68/21.26 % lits eq 0
% 3.68/21.26 % fd_pure 0
% 3.68/21.26 % fd_pseudo 0
% 3.68/21.26 % fd_cond 0
% 3.68/21.26 % fd_pseudo_cond 0
% 3.68/21.26 % AC symbols 0
% 3.68/21.26
% 3.68/21.26 % ------ Schedule dynamic 5 is on
% 3.68/21.26
% 3.68/21.26 % ------ no equalities: superposition off
% 3.68/21.26
% 3.68/21.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/21.26
% 3.68/21.26
% 3.68/21.26 % ------
% 3.68/21.26 % Current options:
% 3.68/21.26 % ------
% 3.68/21.26
% 3.68/21.26
% 3.68/21.26 %
% 3.68/21.26
% 3.68/21.26 % ------ Proving...
% 3.68/21.26 %
% 3.68/21.26
% 3.68/21.26 % SZS status Theorem for theBenchmark.p
% 3.68/21.26
% 3.68/21.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/21.27
% 3.68/21.27
%------------------------------------------------------------------------------