%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX035+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n017.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 03:32:35 PM UTC 2026
% Result : Theorem 6.37s 2.78s
% Output : CNFRefutation 6.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 83 ( 23 unt; 4 def)
% Number of atoms : 316 ( 104 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 300 ( 122 ~; 116 |; 49 &)
% ( 7 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 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 : 9 ( 7 usr; 5 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 161 ( 0 sgn 145 !; 16 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1,X2] :
( times_succeeds(X0,X1,X2)
<=> ( ( X2 = '0'
& X0 = '0' )
| ? [X3,X4] :
( plus_succeeds(X1,X4,X2)
& times_succeeds(X3,X1,X4)
& X0 = s(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id15) ).
fof(f27,axiom,
! [X0] :
( nat_succeeds(X0)
<=> ( X0 = '0'
| ? [X1] :
( nat_succeeds(X1)
& X0 = s(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id27) ).
fof(f30,axiom,
! [X0,X1,X2] :
( nat_succeeds(X0)
=> ( '@+'(X0,X1) = X2
<=> plus_succeeds(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','(@+)/2') ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( nat_succeeds(X1)
& nat_succeeds(X0) )
=> ( '@*'(X0,X1) = X2
<=> times_succeeds(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','(@*)/2') ).
fof(f44,axiom,
! [X0,X1,X2,X3] :
( ( plus_succeeds(X0,X1,X3)
& plus_succeeds(X0,X1,X2) )
=> X2 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(plus:uniqueness)') ).
fof(f59,axiom,
! [X0,X1,X2,X3] :
( ( times_succeeds(X0,X1,X3)
& times_succeeds(X0,X1,X2) )
=> X2 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(times:uniqueness)') ).
fof(f62,conjecture,
! [X0,X1] :
( ( nat_succeeds(X1)
& nat_succeeds(X0) )
=> '@*'(s(X0),X1) = '@+'(X1,'@*'(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(times:successor)') ).
fof(f63,negated_conjecture,
~ ! [X0,X1] :
( ( nat_succeeds(X1)
& nat_succeeds(X0) )
=> '@*'(s(X0),X1) = '@+'(X1,'@*'(X0,X1)) ),
inference(negated_conjecture,[status(cth)],[f62]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X0)
| ( '@+'(X0,X1) = X2
<=> plus_succeeds(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f91,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| ( '@*'(X0,X1) = X2
<=> times_succeeds(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f31]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| ( '@*'(X0,X1) = X2
<=> times_succeeds(X0,X1,X2) ) ),
inference(flattening,[],[f91]) ).
fof(f109,plain,
! [X0,X1,X2,X3] :
( ~ plus_succeeds(X0,X1,X3)
| ~ plus_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(ennf_transformation,[],[f44]) ).
fof(f110,plain,
! [X0,X1,X2,X3] :
( ~ plus_succeeds(X0,X1,X3)
| ~ plus_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(flattening,[],[f109]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ~ times_succeeds(X0,X1,X3)
| ~ times_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(ennf_transformation,[],[f59]) ).
fof(f134,plain,
! [X0,X1,X2,X3] :
( ~ times_succeeds(X0,X1,X3)
| ~ times_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(flattening,[],[f133]) ).
fof(f137,plain,
? [X0,X1] :
( nat_succeeds(X1)
& nat_succeeds(X0)
& '@*'(s(X0),X1) != '@+'(X1,'@*'(X0,X1)) ),
inference(ennf_transformation,[],[f63]) ).
fof(f138,plain,
? [X0,X1] :
( nat_succeeds(X1)
& nat_succeeds(X0)
& '@*'(s(X0),X1) != '@+'(X1,'@*'(X0,X1)) ),
inference(flattening,[],[f137]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ( ~ times_succeeds(X0,X1,X2)
| ( X2 = '0'
& X0 = '0' )
| ? [X3,X4] :
( plus_succeeds(X1,X4,X2)
& times_succeeds(X3,X1,X4)
& X0 = s(X3) ) )
& ( ( ( '0' != X2
| '0' != X0 )
& ! [X3,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| s(X3) != X0 ) )
| times_succeeds(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f141,plain,
! [X0,X1,X2] :
( ( ~ times_succeeds(X0,X1,X2)
| ( X2 = '0'
& X0 = '0' )
| ? [X3,X4] :
( plus_succeeds(X1,X4,X2)
& times_succeeds(X3,X1,X4)
& X0 = s(X3) ) )
& ( ( ( '0' != X2
| '0' != X0 )
& ! [X3,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| s(X3) != X0 ) )
| times_succeeds(X0,X1,X2) ) ),
inference(flattening,[],[f140]) ).
fof(f142,plain,
! [X0,X1,X2] :
( ( ~ times_succeeds(X0,X1,X2)
| ( X2 = '0'
& X0 = '0' )
| ? [X5,X6] :
( plus_succeeds(X1,X6,X2)
& times_succeeds(X5,X1,X6)
& s(X5) = X0 ) )
& ( ( ( '0' != X2
| '0' != X0 )
& ! [X3,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| s(X3) != X0 ) )
| times_succeeds(X0,X1,X2) ) ),
inference(rectify,[],[f141]) ).
fof(f143,plain,
! [X0,X1,X2] :
( ( ~ times_succeeds(X0,X1,X2)
| ( X2 = '0'
& X0 = '0' )
| ( plus_succeeds(X1,sK1(X0,X1,X2),X2)
& times_succeeds(sK0(X0,X1,X2),X1,sK1(X0,X1,X2))
& s(sK0(X0,X1,X2)) = X0 ) )
& ( ( ( '0' != X2
| '0' != X0 )
& ! [X3,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| s(X3) != X0 ) )
| times_succeeds(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X5,sK0(X0,X1,X2)),skolemize(X6,sK1(X0,X1,X2))],[f142]) ).
fof(f184,plain,
! [X0] :
( ( ~ nat_succeeds(X0)
| X0 = '0'
| ? [X1] :
( nat_succeeds(X1)
& X0 = s(X1) ) )
& ( ( '0' != X0
& ! [X1] :
( ~ nat_succeeds(X1)
| s(X1) != X0 ) )
| nat_succeeds(X0) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f185,plain,
! [X0] :
( ( ~ nat_succeeds(X0)
| X0 = '0'
| ? [X1] :
( nat_succeeds(X1)
& X0 = s(X1) ) )
& ( ( '0' != X0
& ! [X1] :
( ~ nat_succeeds(X1)
| s(X1) != X0 ) )
| nat_succeeds(X0) ) ),
inference(flattening,[],[f184]) ).
fof(f186,plain,
! [X0] :
( ( ~ nat_succeeds(X0)
| X0 = '0'
| ? [X2] :
( nat_succeeds(X2)
& s(X2) = X0 ) )
& ( ( '0' != X0
& ! [X1] :
( ~ nat_succeeds(X1)
| s(X1) != X0 ) )
| nat_succeeds(X0) ) ),
inference(rectify,[],[f185]) ).
fof(f187,plain,
! [X0] :
( ( ~ nat_succeeds(X0)
| X0 = '0'
| ( nat_succeeds(sK26(X0))
& s(sK26(X0)) = X0 ) )
& ( ( '0' != X0
& ! [X1] :
( ~ nat_succeeds(X1)
| s(X1) != X0 ) )
| nat_succeeds(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26]),skolemize(X2,sK26(X0))],[f186]) ).
fof(f195,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X0)
| ( ( '@+'(X0,X1) != X2
| plus_succeeds(X0,X1,X2) )
& ( ~ plus_succeeds(X0,X1,X2)
| '@+'(X0,X1) = X2 ) ) ),
inference(nnf_transformation,[],[f90]) ).
fof(f196,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| ( ( '@*'(X0,X1) != X2
| times_succeeds(X0,X1,X2) )
& ( ~ times_succeeds(X0,X1,X2)
| '@*'(X0,X1) = X2 ) ) ),
inference(nnf_transformation,[],[f92]) ).
fof(f201,plain,
( nat_succeeds(sK35)
& nat_succeeds(sK34)
& '@*'(s(sK34),sK35) != '@+'(sK35,'@*'(sK34,sK35)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK34,sK35]),skolemize(X0,sK34),skolemize(X1,sK35)],[f138]) ).
fof(f224,plain,
! [X2,X3,X0,X1,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| s(X3) != X0
| times_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f143]) ).
fof(f295,plain,
! [X0,X1] :
( ~ nat_succeeds(X1)
| s(X1) != X0
| nat_succeeds(X0) ),
inference(cnf_transformation,[],[f187]) ).
fof(f303,plain,
! [X2,X0,X1] :
( ~ nat_succeeds(X0)
| '@+'(X0,X1) != X2
| plus_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f195]) ).
fof(f305,plain,
! [X2,X0,X1] :
( ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| '@*'(X0,X1) != X2
| times_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f196]) ).
fof(f319,plain,
! [X2,X3,X0,X1] :
( ~ plus_succeeds(X0,X1,X3)
| ~ plus_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(cnf_transformation,[],[f110]) ).
fof(f334,plain,
! [X2,X3,X0,X1] :
( ~ times_succeeds(X0,X1,X3)
| ~ times_succeeds(X0,X1,X2)
| X2 = X3 ),
inference(cnf_transformation,[],[f134]) ).
fof(f341,plain,
nat_succeeds(sK35),
inference(cnf_transformation,[],[f201]) ).
fof(f342,plain,
nat_succeeds(sK34),
inference(cnf_transformation,[],[f201]) ).
fof(f343,plain,
'@*'(s(sK34),sK35) != '@+'(sK35,'@*'(sK34,sK35)),
inference(cnf_transformation,[],[f201]) ).
fof(f344,plain,
! [X2,X3,X1,X4] :
( ~ plus_succeeds(X1,X4,X2)
| ~ times_succeeds(X3,X1,X4)
| times_succeeds(s(X3),X1,X2) ),
inference(equality_resolution,[],[f224]) ).
fof(f380,plain,
! [X1] :
( ~ nat_succeeds(X1)
| nat_succeeds(s(X1)) ),
inference(equality_resolution,[],[f295]) ).
fof(f385,plain,
! [X0,X1] :
( ~ nat_succeeds(X0)
| plus_succeeds(X0,X1,'@+'(X0,X1)) ),
inference(equality_resolution,[],[f303]) ).
fof(f386,plain,
! [X0,X1] :
( ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| times_succeeds(X0,X1,'@*'(X0,X1)) ),
inference(equality_resolution,[],[f305]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( times_succeeds(s(X0),X1,X3)
| ~ plus_succeeds(X1,X2,X3)
| ~ times_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f344]) ).
tcf(c_139,plain,
! [X0: $i] :
( nat_succeeds(s(X0))
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f380]) ).
tcf(c_151,plain,
! [X0: $i,X1: $i] :
( plus_succeeds(X0,X1,'@+'(X0,X1))
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f385]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] :
( times_succeeds(X0,X1,'@*'(X0,X1))
| ~ nat_succeeds(X1)
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f386]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X2 = X3 )
| ~ plus_succeeds(X0,X1,X3)
| ~ plus_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f319]) ).
tcf(c_181,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X2 = X3 )
| ~ times_succeeds(X0,X1,X3)
| ~ times_succeeds(X0,X1,X2) ),
inference(cnf_transformation,[],[f334]) ).
tcf(c_188,negated_conjecture,
'@+'(sK35,'@*'(sK34,sK35)) != '@*'(s(sK34),sK35),
inference(cnf_transformation,[],[f343]) ).
tcf(c_189,negated_conjecture,
nat_succeeds(sK34),
inference(cnf_transformation,[],[f342]) ).
tcf(c_190,negated_conjecture,
nat_succeeds(sK35),
inference(cnf_transformation,[],[f341]) ).
tcf(c_3385,definition,
iPr_def_12 = '@*'(sK34,sK35),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_3386,definition,
iPr_def_13 = '@+'(sK35,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_3387,definition,
iPr_def_14 = s(sK34),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_3388,definition,
iPr_def_15 = '@*'(iPr_def_14,sK35),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_3389,negated_conjecture,
nat_succeeds(sK35),
inference(demodulation,[status(thm)],[c_190]) ).
tcf(c_3390,negated_conjecture,
nat_succeeds(sK34),
inference(demodulation,[status(thm)],[c_189]) ).
tcf(c_3391,negated_conjecture,
iPr_def_13 != iPr_def_15,
inference(demodulation,[status(thm)],[c_188,c_3387,c_3388,c_3385,c_3386]) ).
tcf(c_3392,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_3394,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_5816,plain,
( nat_succeeds(iPr_def_14)
| ~ nat_succeeds(sK34) ),
inference(superposition,[status(thm)],[c_3387,c_139]) ).
tcf(c_5819,plain,
nat_succeeds(iPr_def_14),
inference(forward_subsumption_resolution,[status(thm)],[c_5816,c_3390]) ).
tcf(c_6163,plain,
( plus_succeeds(sK35,iPr_def_12,iPr_def_13)
| ~ nat_succeeds(sK35) ),
inference(superposition,[status(thm)],[c_3386,c_151]) ).
tcf(c_6165,plain,
plus_succeeds(sK35,iPr_def_12,iPr_def_13),
inference(forward_subsumption_resolution,[status(thm)],[c_6163,c_3389]) ).
tcf(c_6883,plain,
! [X0: $i] :
( ( iPr_def_13 = iPr_def_15 )
| ( iPr_def_15 != X0 )
| ( iPr_def_13 != X0 ) ),
inference(instantiation,[status(thm)],[c_3394]) ).
tcf(c_7292,plain,
( times_succeeds(sK34,sK35,iPr_def_12)
| ~ nat_succeeds(sK35)
| ~ nat_succeeds(sK34) ),
inference(superposition,[status(thm)],[c_3385,c_153]) ).
tcf(c_7294,plain,
( times_succeeds(iPr_def_14,sK35,iPr_def_15)
| ~ nat_succeeds(iPr_def_14)
| ~ nat_succeeds(sK35) ),
inference(superposition,[status(thm)],[c_3388,c_153]) ).
tcf(c_7308,plain,
times_succeeds(iPr_def_14,sK35,iPr_def_15),
inference(forward_subsumption_resolution,[status(thm)],[c_7294,c_5819,c_3389]) ).
tcf(c_7309,plain,
times_succeeds(sK34,sK35,iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_7292,c_3389,c_3390]) ).
tcf(c_7470,plain,
iPr_def_13 = iPr_def_13,
inference(instantiation,[status(thm)],[c_3392]) ).
tcf(c_7471,plain,
! [X0: $i,X1: $i] :
( ( iPr_def_13 = X0 )
| ( iPr_def_13 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_3394]) ).
tcf(c_8635,plain,
! [X0: $i] :
( ( X0 = iPr_def_13 )
| ~ plus_succeeds(sK35,iPr_def_12,X0) ),
inference(superposition,[status(thm)],[c_6165,c_166]) ).
tcf(c_9359,plain,
! [X0: $i] :
( ( X0 = iPr_def_15 )
| ~ times_succeeds(iPr_def_14,sK35,X0) ),
inference(superposition,[status(thm)],[c_7308,c_181]) ).
tcf(c_9437,plain,
! [X0: $i] :
( times_succeeds(s(sK34),sK35,X0)
| ~ plus_succeeds(sK35,iPr_def_12,X0) ),
inference(superposition,[status(thm)],[c_7309,c_64]) ).
tcf(c_9441,plain,
! [X0: $i] :
( times_succeeds(iPr_def_14,sK35,X0)
| ~ plus_succeeds(sK35,iPr_def_12,X0) ),
inference(light_normalisation,[status(thm)],[c_9437,c_3387]) ).
tcf(c_9957,plain,
( plus_succeeds(sK35,iPr_def_12,iPr_def_13)
| ~ nat_succeeds(sK35) ),
inference(superposition,[status(thm)],[c_3386,c_151]) ).
tcf(c_9959,plain,
plus_succeeds(sK35,iPr_def_12,iPr_def_13),
inference(forward_subsumption_resolution,[status(thm)],[c_9957,c_3389]) ).
tcf(c_10437,plain,
! [X0: $i] :
( ( iPr_def_13 = X0 )
| ( iPr_def_13 != iPr_def_13 )
| ( X0 != iPr_def_13 ) ),
inference(instantiation,[status(thm)],[c_7471]) ).
tcf(c_10634,plain,
! [X0: $i,X1: $i] :
( ( iPr_def_15 = X0 )
| ( iPr_def_15 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_3394]) ).
tcf(c_11987,plain,
iPr_def_15 = iPr_def_15,
inference(instantiation,[status(thm)],[c_3392]) ).
tcf(c_20482,plain,
! [X0: $i] :
( ( iPr_def_15 = X0 )
| ( iPr_def_15 != iPr_def_15 )
| ( X0 != iPr_def_15 ) ),
inference(instantiation,[status(thm)],[c_10634]) ).
tcf(c_29962,plain,
! [X0: $i] :
( ( X0 = iPr_def_13 )
| ~ plus_succeeds(sK35,iPr_def_12,X0) ),
inference(superposition,[status(thm)],[c_9959,c_166]) ).
tcf(c_30134,plain,
! [X0: $i] : ~ plus_succeeds(sK35,iPr_def_12,X0),
inference(global_subsumption_just,[status(thm)],[c_29962,c_3391,c_6883,c_7470,c_8635,c_9359,c_9441,c_10437,c_11987,c_20482]) ).
tcf(c_30137,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_9959,c_30134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX035+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n017.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 23:16:47 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 6.37/2.78 % SZS status Started for theBenchmark.p
% 6.37/2.78 % SZS status Theorem for theBenchmark.p
% 6.37/2.78
% 6.37/2.78 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.37/2.78
% 6.37/2.78 % ------ iProver source info
% 6.37/2.78
% 6.37/2.78 % git: date: 2026-07-19 20:42:38 +0200
% 6.37/2.78 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.37/2.78 % git: non_committed_changes: false
% 6.37/2.78
% 6.37/2.78 % ------ Parsing...
% 6.37/2.78 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.37/2.78
% 6.37/2.78 % ------ Preprocessing... sup_sim: 0 sf_s rm: 11 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 6.37/2.78
% 6.37/2.78 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.37/2.78
% 6.37/2.78 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.37/2.78 % ------ Proving...
% 6.37/2.78 % ------ Problem Properties
% 6.37/2.78
% 6.37/2.78 %
% 6.37/2.78 % clauses 139
% 6.37/2.78 % conjectures 3
% 6.37/2.78 % EPR 35
% 6.37/2.78 % Horn 74
% 6.37/2.78 % unary 19
% 6.37/2.78 % binary 43
% 6.37/2.78 % lits 340
% 6.37/2.78 % lits eq 110
% 6.37/2.78 % fd_pure 0
% 6.37/2.78 % fd_pseudo 0
% 6.37/2.78 % fd_cond 16
% 6.37/2.78 % fd_pseudo_cond 8
% 6.37/2.78 % AC symbols 0
% 6.37/2.78
% 6.37/2.78 % ------ Schedule dynamic 5 is on
% 6.37/2.78
% 6.37/2.78 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.37/2.78
% 6.37/2.78
% 6.37/2.78 % ------
% 6.37/2.78 % Current options:
% 6.37/2.78 % ------
% 6.37/2.78
% 6.37/2.78
% 6.37/2.78 %
% 6.37/2.78
% 6.37/2.78 % ------ Proving...
% 6.37/2.78 %
% 6.37/2.78
% 6.37/2.78 % SZS status Theorem for theBenchmark.p
% 6.37/2.78
% 6.37/2.78 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.37/2.78
% 6.37/2.78
%------------------------------------------------------------------------------