%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX034+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 209.55s 42.68s
% Output : CNFRefutation 209.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 76 ( 24 unt; 0 def)
% Number of atoms : 243 ( 53 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 267 ( 100 ~; 108 |; 41 &)
% ( 2 <=>; 16 =>; 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 ( 6 usr; 4 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 154 ( 0 sgn 134 !; 20 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : '0' != s(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id1) ).
fof(f2,axiom,
! [X0,X1] :
( s(X0) = s(X1)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id2) ).
fof(f17,axiom,
! [X0,X1,X2] :
( times_terminates(X0,X1,X2)
<=> ( ( $true
| X0 != '0' )
& $true
& ! [X3,X4] :
( ( ( ( plus_terminates(X1,X4,X2)
| times_fails(X3,X1,X4) )
& times_terminates(X3,X1,X4) )
| X0 != s(X3) )
& $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',id17) ).
fof(f34,axiom,
! [X0,X1,X2] :
( nat_succeeds(X0)
=> plus_terminates(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(plus:termination:1)') ).
fof(f57,axiom,
( ! [X0] :
( ( X0 = '0'
| ? [X1] :
( ! [X2,X3] :
( nat_succeeds(X2)
=> times_terminates(X1,X2,X3) )
& nat_succeeds(X1)
& X0 = s(X1) ) )
=> ! [X2,X3] :
( nat_succeeds(X2)
=> times_terminates(X0,X2,X3) ) )
=> ! [X0] :
( nat_succeeds(X0)
=> ! [X2,X3] :
( nat_succeeds(X2)
=> times_terminates(X0,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction) ).
fof(f58,conjecture,
! [X0,X1,X2] :
( ( nat_succeeds(X1)
& nat_succeeds(X0) )
=> times_terminates(X0,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(times:termination)') ).
fof(f59,negated_conjecture,
~ ! [X0,X1,X2] :
( ( nat_succeeds(X1)
& nat_succeeds(X0) )
=> times_terminates(X0,X1,X2) ),
inference(negated_conjecture,[status(cth)],[f58]) ).
fof(f60,plain,
( ! [X0] :
( ( X0 = '0'
| ? [X1] :
( ! [X2,X3] :
( nat_succeeds(X2)
=> times_terminates(X1,X2,X3) )
& nat_succeeds(X1)
& X0 = s(X1) ) )
=> ! [X4,X5] :
( nat_succeeds(X4)
=> times_terminates(X0,X4,X5) ) )
=> ! [X6] :
( nat_succeeds(X6)
=> ! [X7,X8] :
( nat_succeeds(X7)
=> times_terminates(X6,X7,X8) ) ) ),
inference(rectify,[],[f57]) ).
fof(f61,plain,
! [X0,X1,X2] :
( times_terminates(X0,X1,X2)
<=> ! [X3,X4] :
( ( ( plus_terminates(X1,X4,X2)
| times_fails(X3,X1,X4) )
& times_terminates(X3,X1,X4) )
| X0 != s(X3) ) ),
inference(true_and_false_elimination,[],[f17]) ).
fof(f64,plain,
? [X0,X1,X2] :
( nat_succeeds(X1)
& nat_succeeds(X0)
& ~ times_terminates(X0,X1,X2) ),
inference(ennf_transformation,[],[f59]) ).
fof(f65,plain,
? [X0,X1,X2] :
( nat_succeeds(X1)
& nat_succeeds(X0)
& ~ times_terminates(X0,X1,X2) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
( ? [X0] :
( ( X0 = '0'
| ? [X1] :
( ! [X2,X3] :
( ~ nat_succeeds(X2)
| times_terminates(X1,X2,X3) )
& nat_succeeds(X1)
& X0 = s(X1) ) )
& ? [X4,X5] :
( nat_succeeds(X4)
& ~ times_terminates(X0,X4,X5) ) )
| ! [X6] :
( ~ nat_succeeds(X6)
| ! [X7,X8] :
( ~ nat_succeeds(X7)
| times_terminates(X6,X7,X8) ) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f69,plain,
! [X0,X1] :
( s(X0) != s(X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f2]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ nat_succeeds(X0)
| plus_terminates(X0,X1,X2) ),
inference(ennf_transformation,[],[f34]) ).
fof(f97,plain,
( nat_succeeds(sK1)
& nat_succeeds(sK0)
& ~ times_terminates(sK0,sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f65]) ).
fof(f98,plain,
( ? [X3] :
( ( '0' = X3
| ? [X6] :
( ! [X7,X8] :
( ~ nat_succeeds(X7)
| times_terminates(X6,X7,X8) )
& nat_succeeds(X6)
& s(X6) = X3 ) )
& ? [X4,X5] :
( nat_succeeds(X4)
& ~ times_terminates(X3,X4,X5) ) )
| ! [X0] :
( ~ nat_succeeds(X0)
| ! [X1,X2] :
( ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ) ) ),
inference(rectify,[],[f66]) ).
fof(f99,plain,
( ( ( '0' = sK3
| ( ! [X7,X8] :
( ~ nat_succeeds(X7)
| times_terminates(sK6,X7,X8) )
& nat_succeeds(sK6)
& sK3 = s(sK6) ) )
& nat_succeeds(sK4)
& ~ times_terminates(sK3,sK4,sK5) )
| ! [X0] :
( ~ nat_succeeds(X0)
| ! [X1,X2] :
( ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f98]) ).
fof(f100,plain,
! [X0,X1,X2] :
( ( ~ times_terminates(X0,X1,X2)
| ! [X3,X4] :
( ( ( plus_terminates(X1,X4,X2)
| times_fails(X3,X1,X4) )
& times_terminates(X3,X1,X4) )
| X0 != s(X3) ) )
& ( ? [X3,X4] :
( ( ( ~ plus_terminates(X1,X4,X2)
& ~ times_fails(X3,X1,X4) )
| ~ times_terminates(X3,X1,X4) )
& s(X3) = X0 )
| times_terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f101,plain,
! [X0,X1,X2] :
( ( ~ times_terminates(X0,X1,X2)
| ! [X5,X6] :
( ( ( plus_terminates(X1,X6,X2)
| times_fails(X5,X1,X6) )
& times_terminates(X5,X1,X6) )
| s(X5) != X0 ) )
& ( ? [X3,X4] :
( ( ( ~ plus_terminates(X1,X4,X2)
& ~ times_fails(X3,X1,X4) )
| ~ times_terminates(X3,X1,X4) )
& s(X3) = X0 )
| times_terminates(X0,X1,X2) ) ),
inference(rectify,[],[f100]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( ~ times_terminates(X0,X1,X2)
| ! [X5,X6] :
( ( ( plus_terminates(X1,X6,X2)
| times_fails(X5,X1,X6) )
& times_terminates(X5,X1,X6) )
| s(X5) != X0 ) )
& ( ( ( ( ~ plus_terminates(X1,sK8(X0,X1,X2),X2)
& ~ times_fails(sK7(X0,X1,X2),X1,sK8(X0,X1,X2)) )
| ~ times_terminates(sK7(X0,X1,X2),X1,sK8(X0,X1,X2)) )
& s(sK7(X0,X1,X2)) = X0 )
| times_terminates(X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X3,sK7(X0,X1,X2)),skolemize(X4,sK8(X0,X1,X2))],[f101]) ).
fof(f128,plain,
nat_succeeds(sK1),
inference(cnf_transformation,[],[f97]) ).
fof(f129,plain,
nat_succeeds(sK0),
inference(cnf_transformation,[],[f97]) ).
fof(f130,plain,
~ times_terminates(sK0,sK1,sK2),
inference(cnf_transformation,[],[f97]) ).
fof(f131,plain,
! [X2,X0,X1,X8,X7] :
( '0' = sK3
| ~ nat_succeeds(X7)
| times_terminates(sK6,X7,X8)
| ~ nat_succeeds(X0)
| ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f133,plain,
! [X2,X0,X1] :
( '0' = sK3
| sK3 = s(sK6)
| ~ nat_succeeds(X0)
| ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f134,plain,
! [X2,X0,X1] :
( nat_succeeds(sK4)
| ~ nat_succeeds(X0)
| ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f135,plain,
! [X2,X0,X1] :
( ~ times_terminates(sK3,sK4,sK5)
| ~ nat_succeeds(X0)
| ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
fof(f138,plain,
! [X2,X0,X1] :
( ~ plus_terminates(X1,sK8(X0,X1,X2),X2)
| ~ times_terminates(sK7(X0,X1,X2),X1,sK8(X0,X1,X2))
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f140,plain,
! [X2,X0,X1] :
( s(sK7(X0,X1,X2)) = X0
| times_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f146,plain,
! [X0,X1] :
( s(X0) != s(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f69]) ).
fof(f155,plain,
! [X0] : '0' != s(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f167,plain,
! [X2,X0,X1] :
( ~ nat_succeeds(X0)
| plus_terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_49,negated_conjecture,
~ times_terminates(sK0,sK1,sK2),
inference(cnf_transformation,[],[f130]) ).
tcf(c_50,negated_conjecture,
nat_succeeds(sK0),
inference(cnf_transformation,[],[f129]) ).
tcf(c_51,negated_conjecture,
nat_succeeds(sK1),
inference(cnf_transformation,[],[f128]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( times_terminates(X0,X1,X2)
| ~ nat_succeeds(X1)
| ~ nat_succeeds(X0)
| ~ times_terminates(sK3,sK4,sK5) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( nat_succeeds(sK4)
| times_terminates(X0,X1,X2)
| ~ nat_succeeds(X1)
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( times_terminates(X0,X1,X2)
| ( sK3 = '0' )
| ( s(sK6) = sK3 )
| ~ nat_succeeds(X1)
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( times_terminates(sK6,X2,X4)
| times_terminates(X0,X1,X3)
| ( sK3 = '0' )
| ~ nat_succeeds(X2)
| ~ nat_succeeds(X1)
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( times_terminates(X0,X1,X2)
| ( s(sK7(X0,X1,X2)) = X0 ) ),
inference(cnf_transformation,[],[f140]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( times_terminates(X0,X1,X2)
| ~ plus_terminates(X1,sK8(X0,X1,X2),X2)
| ~ times_terminates(sK7(X0,X1,X2),X1,sK8(X0,X1,X2)) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( s(X0) != s(X1) ) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_76,plain,
! [X0: $i] : s(X0) != '0',
inference(cnf_transformation,[],[f155]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i,X2: $i] :
( plus_terminates(X0,X1,X2)
| ~ nat_succeeds(X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_1845,plain,
! [X0: $i,X1: $i] :
( ~ iPr_def_10
| ~ nat_succeeds(X0)
| times_terminates(sK6,X0,X1) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_56]) ).
tcf(c_1846,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ iPr_def_11
| ~ nat_succeeds(X0)
| ~ nat_succeeds(X1)
| times_terminates(X0,X1,X2) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_56]) ).
tcf(c_1847,plain,
( iPr_def_11
| iPr_def_10
| ( sK3 = '0' ) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_56]) ).
tcf(c_1849,plain,
( iPr_def_11
| ( sK3 = '0' )
| ( s(sK6) = sK3 ) ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_54]) ).
tcf(c_3317,plain,
( nat_succeeds(sK4)
| ~ nat_succeeds(sK1)
| ~ nat_succeeds(sK0) ),
inference(superposition,[status(thm)],[c_53,c_49]) ).
tcf(c_3319,plain,
nat_succeeds(sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_3317,c_51,c_50]) ).
tcf(c_3661,plain,
( times_terminates(sK0,sK1,sK2)
| ~ nat_succeeds(sK1)
| ~ nat_succeeds(sK0)
| ~ times_terminates(sK3,sK4,sK5) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_3875,plain,
~ times_terminates(sK3,sK4,sK5),
inference(global_subsumption_just,[status(thm)],[c_52,c_51,c_50,c_49,c_3661]) ).
tcf(c_3877,plain,
s(sK7(sK3,sK4,sK5)) = sK3,
inference(superposition,[status(thm)],[c_57,c_3875]) ).
tcf(c_4264,plain,
sK3 != '0',
inference(superposition,[status(thm)],[c_3877,c_76]) ).
tcf(c_4309,plain,
( iPr_def_11
| ( s(sK6) = sK3 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1849,c_4264]) ).
tcf(c_4311,plain,
( iPr_def_11
| iPr_def_10 ),
inference(backward_subsumption_resolution,[status(thm)],[c_1847,c_4264]) ).
tcf(c_5546,plain,
( plus_terminates(sK4,sK8(sK3,sK4,sK5),sK5)
| ~ nat_succeeds(sK4) ),
inference(instantiation,[status(thm)],[c_88]) ).
tcf(c_8197,plain,
( times_terminates(sK0,sK1,sK2)
| ~ iPr_def_11
| ~ nat_succeeds(sK1)
| ~ nat_succeeds(sK0) ),
inference(instantiation,[status(thm)],[c_1846]) ).
tcf(c_30388,plain,
~ iPr_def_11,
inference(global_subsumption_just,[status(thm)],[c_1846,c_51,c_50,c_49,c_8197]) ).
tcf(c_30391,plain,
s(sK6) = sK3,
inference(backward_subsumption_resolution,[status(thm)],[c_4309,c_30388]) ).
tcf(c_30448,plain,
! [X0: $i] :
( ( X0 = sK6 )
| ( s(X0) != sK3 ) ),
inference(superposition,[status(thm)],[c_30391,c_67]) ).
tcf(c_33982,plain,
sK7(sK3,sK4,sK5) = sK6,
inference(superposition,[status(thm)],[c_3877,c_30448]) ).
tcf(c_47787,plain,
( times_terminates(sK3,sK4,sK5)
| ~ plus_terminates(sK4,sK8(sK3,sK4,sK5),sK5)
| ~ times_terminates(sK6,sK4,sK8(sK3,sK4,sK5)) ),
inference(superposition,[status(thm)],[c_33982,c_59]) ).
tcf(c_47789,plain,
( ~ plus_terminates(sK4,sK8(sK3,sK4,sK5),sK5)
| ~ times_terminates(sK6,sK4,sK8(sK3,sK4,sK5)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_47787,c_3875]) ).
tcf(c_268198,plain,
~ times_terminates(sK3,sK4,sK5),
inference(global_subsumption_just,[status(thm)],[c_52,c_51,c_50,c_49,c_3661]) ).
tcf(c_268200,plain,
nat_succeeds(sK4),
inference(global_subsumption_just,[status(thm)],[c_53,c_3319]) ).
tcf(c_268205,plain,
s(sK7(sK3,sK4,sK5)) = sK3,
inference(superposition,[status(thm)],[c_57,c_268198]) ).
tcf(c_268659,plain,
! [X0: $i] :
( ( sK7(sK3,sK4,sK5) = X0 )
| ( s(X0) != sK3 ) ),
inference(superposition,[status(thm)],[c_268205,c_67]) ).
tcf(c_269153,plain,
! [X0: $i,X1: $i] :
( times_terminates(sK6,X0,X1)
| ~ nat_succeeds(X0) ),
inference(global_subsumption_just,[status(thm)],[c_1845,c_51,c_50,c_49,c_1845,c_4311,c_8197]) ).
tcf(c_269533,plain,
s(sK6) = sK3,
inference(global_subsumption_just,[status(thm)],[c_1849,c_51,c_50,c_49,c_4309,c_8197]) ).
tcf(c_272722,plain,
sK7(sK3,sK4,sK5) = sK6,
inference(superposition,[status(thm)],[c_269533,c_268659]) ).
tcf(c_272765,plain,
( times_terminates(sK3,sK4,sK5)
| ~ plus_terminates(sK4,sK8(sK3,sK4,sK5),sK5)
| ~ times_terminates(sK6,sK4,sK8(sK3,sK4,sK5)) ),
inference(superposition,[status(thm)],[c_272722,c_59]) ).
tcf(c_272767,plain,
( ~ plus_terminates(sK4,sK8(sK3,sK4,sK5),sK5)
| ~ times_terminates(sK6,sK4,sK8(sK3,sK4,sK5)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_272765,c_268198]) ).
tcf(c_347530,plain,
~ times_terminates(sK6,sK4,sK8(sK3,sK4,sK5)),
inference(global_subsumption_just,[status(thm)],[c_272767,c_3319,c_5546,c_47789]) ).
tcf(c_347539,plain,
~ nat_succeeds(sK4),
inference(superposition,[status(thm)],[c_269153,c_347530]) ).
tcf(c_347542,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_347539,c_268200]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX034+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/10.40 % Computer : n017.cluster.edu
% 0.12/10.40 % Model : x86_64 x86_64
% 0.12/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.40 % Memory : 8046.5625MB
% 0.12/10.40 % OS : Linux 6.8.0-71-generic
% 0.02/10.40 % CPULimit : 300
% 0.02/10.40 % WCLimit : 300
% 0.02/10.40 % DateTime : Thu Sep 24 23:16:12 UTC 2026
% 0.02/10.40 % CPUTime :
% 0.02/10.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/10.46 Running first-order theorem proving
% 0.02/10.46 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.02/10.47
% 0.02/10.47 % ======== iProver multi-core TPTP/SMT =========
% 0.02/10.47
% 0.02/10.47 % Detected problem language: tptp
% 0.02/10.49 % Proving...
% 209.55/42.68 % SZS status Started for theBenchmark.p
% 209.55/42.68 % SZS status Theorem for theBenchmark.p
% 209.55/42.68
% 209.55/42.68 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 209.55/42.68
% 209.55/42.68 % ------ iProver source info
% 209.55/42.68
% 209.55/42.68 % git: date: 2026-07-19 20:42:38 +0200
% 209.55/42.68 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 209.55/42.68 % git: non_committed_changes: false
% 209.55/42.68
% 209.55/42.68 % ------ Parsing...
% 209.55/42.68 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 209.55/42.68
% 209.55/42.68 % ------ 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 %
% 209.55/42.68
% 209.55/42.68 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e %
% 209.55/42.68
% 209.55/42.68 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 209.55/42.68 % ------ Proving...
% 209.55/42.68 % ------ Problem Properties
% 209.55/42.68
% 209.55/42.68 %
% 209.55/42.68 % clauses 71
% 209.55/42.68 % conjectures 3
% 209.55/42.68 % EPR 27
% 209.55/42.68 % Horn 34
% 209.55/42.68 % unary 9
% 209.55/42.68 % binary 18
% 209.55/42.68 % lits 180
% 209.55/42.68 % lits eq 50
% 209.55/42.68 % fd_pure 0
% 209.55/42.68 % fd_pseudo 0
% 209.55/42.68 % fd_cond 11
% 209.55/42.68 % fd_pseudo_cond 4
% 209.55/42.68 % AC symbols 0
% 209.55/42.68
% 209.55/42.68 % ------ Schedule dynamic 5 is on
% 209.55/42.68
% 209.55/42.68 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 % ------
% 209.55/42.68 % Current options:
% 209.55/42.68 % ------
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 %
% 209.55/42.68
% 209.55/42.68 % ------ Proving...
% 209.55/42.68 % Proof_search_loop: time out after: 4088 full_loop iterations
% 209.55/42.68
% 209.55/42.68 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 % ------
% 209.55/42.68 % Current options:
% 209.55/42.68 % ------
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 %
% 209.55/42.68
% 209.55/42.68 % ------ Proving...
% 209.55/42.68 % Proof_search_loop: time out after: 6358 full_loop iterations
% 209.55/42.68
% 209.55/42.68 % ------ Option_1: Negative Selections Time Limit: 35.
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 % ------
% 209.55/42.68 % Current options:
% 209.55/42.68 % ------
% 209.55/42.68
% 209.55/42.68
% 209.55/42.68 %
% 209.55/42.68
% 209.55/42.68 % ------ Proving...
% 209.55/42.68 %
% 209.55/42.68
% 209.55/42.68 % SZS status Theorem for theBenchmark.p
% 209.55/42.68
% 209.55/42.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 209.55/42.68
% 209.55/42.68
%------------------------------------------------------------------------------