%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET795+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 : n018.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:36 PM UTC 2026
% Result : Theorem 3.74s 1.28s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 67 ( 15 unt; 0 def)
% Number of atoms : 268 ( 36 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 311 ( 110 ~; 108 |; 65 &)
% ( 6 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 183 ( 0 sgn 171 !; 12 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( X0 = X2
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',unordered_pair) ).
fof(f12,axiom,
! [X0,X1] :
( 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,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X2)
& apply(X0,X2,X3) )
=> X2 = X3 ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',order) ).
fof(f14,axiom,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',upper_bound) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( least_upper_bound(X0,X1,X2,X3)
<=> ( ! [X4] :
( ( upper_bound(X4,X2,X1)
& member(X4,X3) )
=> apply(X2,X0,X4) )
& upper_bound(X0,X2,X1)
& member(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+3.ax',least_upper_bound) ).
fof(f22,conjecture,
! [X0,X1,X2,X3] :
( ( apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV7) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1) )
=> least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
inference(negated_conjecture,[status(cth)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( order(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) ) )
& ! [X3,X4] :
( ( member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
=> X3 = X4 ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
inference(rectify,[],[f12]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( ( ! [X4] :
( ( upper_bound(X4,X2,X1)
& member(X4,X3) )
=> apply(X2,X0,X4) )
& upper_bound(X0,X2,X1)
& member(X0,X1) )
=> least_upper_bound(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f26,plain,
! [X0,X1] :
( order(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) ) )
& ! [X3,X4] :
( ( member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X3)
& apply(X0,X3,X4) )
=> X3 = X4 ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f27,plain,
? [X0,X1,X2,X3] :
( apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1)
& ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f28,plain,
? [X0,X1,X2,X3] :
( apply(X0,X2,X3)
& member(X3,X1)
& member(X2,X1)
& order(X0,X1)
& ~ least_upper_bound(X3,unordered_pair(X2,X3),X0,X1) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ~ order(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) )
& ! [X3,X4] :
( ~ member(X4,X1)
| ~ member(X3,X1)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4)
| X3 = X4 )
& ! [X2] :
( ~ member(X2,X1)
| apply(X0,X2,X2) ) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f30,plain,
! [X0,X1] :
( ~ order(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) )
& ! [X3,X4] :
( ~ member(X4,X1)
| ~ member(X3,X1)
| ~ apply(X0,X4,X3)
| ~ apply(X0,X3,X4)
| X3 = X4 )
& ! [X2] :
( ~ member(X2,X1)
| apply(X0,X2,X2) ) ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( upper_bound(X4,X2,X1)
& member(X4,X3)
& ~ apply(X2,X0,X4) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f25]) ).
fof(f32,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( upper_bound(X4,X2,X1)
& member(X4,X3)
& ~ apply(X2,X0,X4) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(flattening,[],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( upper_bound(X2,X0,X1)
<=> ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) ) ),
inference(ennf_transformation,[],[f14]) ).
fof(f34,plain,
( apply(sK0,sK2,sK3)
& member(sK3,sK1)
& member(sK2,sK1)
& order(sK0,sK1)
& ~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f28]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 )
& ( ( X0 != X2
& X0 != X1 )
| member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 )
& ( ( X0 != X2
& X0 != X1 )
| member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0,X1,X2,X3] :
( ( upper_bound(sK4(X0,X1,X2,X3),X2,X1)
& member(sK4(X0,X1,X2,X3),X3)
& ~ apply(X2,X0,sK4(X0,X1,X2,X3)) )
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(X4,sK4(X0,X1,X2,X3))],[f32]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( ~ upper_bound(X2,X0,X1)
| ! [X3] :
( ~ member(X3,X1)
| apply(X0,X3,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ apply(X0,X3,X2) )
| upper_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( ~ upper_bound(X2,X0,X1)
| ! [X4] :
( ~ member(X4,X1)
| apply(X0,X4,X2) ) )
& ( ? [X3] :
( member(X3,X1)
& ~ apply(X0,X3,X2) )
| upper_bound(X2,X0,X1) ) ),
inference(rectify,[],[f38]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( ~ upper_bound(X2,X0,X1)
| ! [X4] :
( ~ member(X4,X1)
| apply(X0,X4,X2) ) )
& ( ( member(sK5(X0,X1,X2),X1)
& ~ apply(X0,sK5(X0,X1,X2),X2) )
| upper_bound(X2,X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X3,sK5(X0,X1,X2))],[f39]) ).
fof(f41,plain,
apply(sK0,sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f42,plain,
member(sK3,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f44,plain,
order(sK0,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f45,plain,
~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1),
inference(cnf_transformation,[],[f34]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ order(X0,X1)
| ~ member(X2,X1)
| apply(X0,X2,X2) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f36]) ).
fof(f50,plain,
! [X2,X0,X1] :
( X0 != X2
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f52,plain,
! [X2,X3,X0,X1] :
( upper_bound(sK4(X0,X1,X2,X3),X2,X1)
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f37]) ).
fof(f54,plain,
! [X2,X3,X0,X1] :
( ~ apply(X2,X0,sK4(X0,X1,X2,X3))
| ~ upper_bound(X0,X2,X1)
| ~ member(X0,X1)
| least_upper_bound(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f37]) ).
fof(f55,plain,
! [X2,X0,X1,X4] :
( ~ upper_bound(X2,X0,X1)
| ~ member(X4,X1)
| apply(X0,X4,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f56,plain,
! [X2,X0,X1] :
( member(sK5(X0,X1,X2),X1)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK5(X0,X1,X2),X2)
| upper_bound(X2,X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f59,plain,
! [X2,X1] : member(X2,unordered_pair(X1,X2)),
inference(equality_resolution,[],[f50]) ).
tcf(c_49,negated_conjecture,
~ least_upper_bound(sK3,unordered_pair(sK2,sK3),sK0,sK1),
inference(cnf_transformation,[],[f45]) ).
tcf(c_50,negated_conjecture,
order(sK0,sK1),
inference(cnf_transformation,[],[f44]) ).
tcf(c_52,negated_conjecture,
member(sK3,sK1),
inference(cnf_transformation,[],[f42]) ).
tcf(c_53,negated_conjecture,
apply(sK0,sK2,sK3),
inference(cnf_transformation,[],[f41]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( apply(X0,X2,X2)
| ~ member(X2,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : member(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f59]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( least_upper_bound(X1,X2,X0,X3)
| ~ member(X1,X2)
| ~ upper_bound(X1,X0,X2)
| ~ apply(X0,X1,sK4(X1,X2,X0,X3)) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( least_upper_bound(X0,X2,X1,X3)
| upper_bound(sK4(X0,X2,X1,X3),X1,X2)
| ~ member(X0,X2)
| ~ upper_bound(X0,X1,X2) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( upper_bound(X2,X0,X1)
| ~ apply(X0,sK5(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] :
( upper_bound(X2,X0,X1)
| member(sK5(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( apply(X1,X3,X0)
| ~ member(X3,X2)
| ~ upper_bound(X0,X1,X2) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_249,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( upper_bound(sK4(X1,X0,X2,X3),X2,X0)
| ~ member(X1,X0)
| ~ upper_bound(X1,X2,X0)
| ( X3 != sK1 )
| ( X2 != sK0 )
| ( X1 != sK3 )
| ( unordered_pair(sK2,sK3) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_62]) ).
tcf(c_250,plain,
( upper_bound(sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1),sK0,unordered_pair(sK2,sK3))
| ~ member(sK3,unordered_pair(sK2,sK3))
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3)) ),
inference(unflattening,[status(thm)],[c_249]) ).
tcf(c_257,plain,
( upper_bound(sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1),sK0,unordered_pair(sK2,sK3))
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_250,c_58]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ member(X1,X0)
| ~ upper_bound(X1,X2,X0)
| ~ apply(X2,X1,sK4(X1,X0,X2,X3))
| ( X3 != sK1 )
| ( X2 != sK0 )
| ( X1 != sK3 )
| ( unordered_pair(sK2,sK3) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_60]) ).
tcf(c_272,plain,
( ~ member(sK3,unordered_pair(sK2,sK3))
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ apply(sK0,sK3,sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1)) ),
inference(unflattening,[status(thm)],[c_271]) ).
tcf(c_279,plain,
( ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ apply(sK0,sK3,sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_272,c_58]) ).
tcf(c_288,plain,
! [X0: $i,X1: $i,X2: $i] :
( apply(X0,X2,X2)
| ~ member(X2,X1)
| ( X1 != sK1 )
| ( X0 != sK0 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_54]) ).
tcf(c_289,plain,
! [X0: $i] :
( apply(sK0,X0,X0)
| ~ member(X0,sK1) ),
inference(unflattening,[status(thm)],[c_288]) ).
tcf(c_803,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( upper_bound(X3,X0,unordered_pair(X1,X2))
| ( sK5(X0,unordered_pair(X1,X2),X3) = X2 )
| ( sK5(X0,unordered_pair(X1,X2),X3) = X1 ) ),
inference(superposition,[status(thm)],[c_64,c_59]) ).
tcf(c_820,plain,
! [X0: $i] :
( apply(sK0,X0,sK4(sK3,unordered_pair(sK2,sK3),sK0,sK1))
| ~ member(X0,unordered_pair(sK2,sK3))
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3)) ),
inference(superposition,[status(thm)],[c_257,c_65]) ).
tcf(c_832,plain,
( ~ member(sK3,unordered_pair(sK2,sK3))
| ~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3)) ),
inference(superposition,[status(thm)],[c_820,c_279]) ).
tcf(c_836,plain,
~ upper_bound(sK3,sK0,unordered_pair(sK2,sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_832,c_58]) ).
tcf(c_844,plain,
( ( sK5(sK0,unordered_pair(sK2,sK3),sK3) = sK2 )
| ( sK5(sK0,unordered_pair(sK2,sK3),sK3) = sK3 ) ),
inference(superposition,[status(thm)],[c_803,c_836]) ).
tcf(c_856,plain,
( upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ( sK5(sK0,unordered_pair(sK2,sK3),sK3) = sK3 )
| ~ apply(sK0,sK2,sK3) ),
inference(superposition,[status(thm)],[c_844,c_63]) ).
tcf(c_858,plain,
sK5(sK0,unordered_pair(sK2,sK3),sK3) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_856,c_836,c_53]) ).
tcf(c_859,plain,
( upper_bound(sK3,sK0,unordered_pair(sK2,sK3))
| ~ apply(sK0,sK3,sK3) ),
inference(superposition,[status(thm)],[c_858,c_63]) ).
tcf(c_861,plain,
~ apply(sK0,sK3,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_859,c_836]) ).
tcf(c_862,plain,
~ member(sK3,sK1),
inference(superposition,[status(thm)],[c_289,c_861]) ).
tcf(c_863,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_862,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET795+4 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n018.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 12:00:48 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...
% 3.74/1.28 % SZS status Started for theBenchmark.p
% 3.74/1.28 % SZS status Theorem for theBenchmark.p
% 3.74/1.28
% 3.74/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.74/1.28
% 3.74/1.28 % ------ iProver source info
% 3.74/1.28
% 3.74/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.74/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.74/1.28 % git: non_committed_changes: false
% 3.74/1.28
% 3.74/1.28 % ------ Parsing...
% 3.74/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.74/1.28
% 3.74/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.74/1.28
% 3.74/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.74/1.28
% 3.74/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.74/1.28 % ------ Proving...
% 3.74/1.28 % ------ Problem Properties
% 3.74/1.28
% 3.74/1.28 %
% 3.74/1.28 % clauses 15
% 3.74/1.28 % conjectures 3
% 3.74/1.28 % EPR 7
% 3.74/1.28 % Horn 13
% 3.74/1.28 % unary 5
% 3.74/1.28 % binary 6
% 3.74/1.28 % lits 34
% 3.74/1.28 % lits eq 3
% 3.74/1.28 % fd_pure 0
% 3.74/1.28 % fd_pseudo 0
% 3.74/1.28 % fd_cond 0
% 3.74/1.28 % fd_pseudo_cond 2
% 3.74/1.28 % AC symbols 0
% 3.74/1.28
% 3.74/1.28 % ------ Schedule dynamic 5 is on
% 3.74/1.28
% 3.74/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.74/1.28
% 3.74/1.28
% 3.74/1.28 % ------
% 3.74/1.28 % Current options:
% 3.74/1.28 % ------
% 3.74/1.28
% 3.74/1.28
% 3.74/1.28 %
% 3.74/1.28
% 3.74/1.28 % ------ Proving...
% 3.74/1.28 %
% 3.74/1.28
% 3.74/1.28 % SZS status Theorem for theBenchmark.p
% 3.74/1.28
% 3.74/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.29
% 3.74/1.29
%------------------------------------------------------------------------------