%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV487+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n005.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:22:23 PM UTC 2026
% Result : Theorem 0.74s 1.28s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 80 ( 23 unt; 1 def)
% Number of atoms : 280 ( 64 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 319 ( 129 ~; 130 |; 44 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 113 ( 0 sgn 106 !; 7 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( X0 = X1
| int_less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X1,X2)
& int_less(X0,X1) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X2] :
( ( X1 = plus(X0,X2)
& int_leq(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X2)) = lu(X3,plus(X3,X2)) ) )
& ! [X2] :
( ( X0 = plus(X1,X2)
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(plus(X3,X2),X3) = real_zero ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qiu) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ut) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1) )
=> a(X0,X1) = real_zero ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(X1,n)
& int_leq(int_one,X1)
& int_leq(X0,n)
& int_leq(int_one,X0) )
=> ( ! [X4] :
( ( plus(X0,X4) = X1
& int_leq(int_zero,X4) )
=> ! [X5] :
( ( int_leq(X5,X0)
& int_leq(int_one,X5) )
=> a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) )
& ! [X2] :
( ( X0 = plus(X1,X2)
& int_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X1)
& int_leq(int_one,X3) )
=> a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(flattening,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ( ! [X4] :
( plus(X0,X4) != X1
| ~ int_leq(int_zero,X4)
| ! [X5] :
( ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) )
& ! [X2] :
( plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ! [X3] :
( ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ( ! [X4] :
( plus(X0,X4) != X1
| ~ int_leq(int_zero,X4)
| ! [X5] :
( ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| a(X5,plus(X5,X4)) = lu(X5,plus(X5,X4)) ) )
& ! [X2] :
( plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ! [X3] :
( ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| a(plus(X3,X2),X3) = real_zero ) ) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
? [X0,X1] :
( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1)
& real_zero != a(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( int_leq(X0,n)
& int_less(X1,X0)
& int_leq(int_one,X1)
& real_zero != a(X0,X1) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) )
& ( ( X0 != X1
& ~ int_less(X0,X1) )
| int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( ( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) )
& ( ( X0 != X1
& ~ int_less(X0,X1) )
| int_leq(X0,X1) ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ? [X2] :
( int_less(int_zero,X2)
& plus(X0,X2) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ? [X3] :
( int_less(int_zero,X3)
& plus(X0,X3) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ( int_less(int_zero,sK0(X0,X1))
& plus(X0,sK0(X0,X1)) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f28]) ).
fof(f30,plain,
! [X0] :
( ( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) )
& ( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f31,plain,
( int_leq(sK1,n)
& int_less(sK2,sK1)
& int_leq(int_one,sK2)
& real_zero != a(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f24]) ).
fof(f32,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
! [X0,X1] :
( X0 != X1
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_less(int_zero,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f45,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| plus(X1,X2) != X0
| ~ int_less(int_zero,X2)
| ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| real_zero = a(plus(X3,X2),X3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f50,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f33]) ).
fof(f57,plain,
! [X2,X3,X1] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(plus(X1,X2),n)
| ~ int_leq(int_one,plus(X1,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(X3,X1)
| ~ int_leq(int_one,X3)
| real_zero = a(plus(X3,X2),X3) ),
inference(equality_resolution,[],[f49]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_50,plain,
! [X0: $i] : int_leq(X0,X0),
inference(cnf_transformation,[],[f54]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( int_less(X0,X1)
| ( X0 = X1 )
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( int_less(X0,X2)
| ~ int_less(X1,X2)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( plus(X0,sK0(X0,X1)) = X1 )
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_62,plain,
! [X0: $i] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_63,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(plus(X2,X1),X2) = real_zero )
| ~ int_less(int_zero,X1)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(plus(X0,X1),n) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_67,negated_conjecture,
a(sK1,sK2) != real_zero,
inference(cnf_transformation,[],[f53]) ).
tcf(c_68,negated_conjecture,
int_leq(int_one,sK2),
inference(cnf_transformation,[],[f52]) ).
tcf(c_69,negated_conjecture,
int_less(sK2,sK1),
inference(cnf_transformation,[],[f51]) ).
tcf(c_70,negated_conjecture,
int_leq(sK1,n),
inference(cnf_transformation,[],[f50]) ).
tcf(c_81,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(prop_impl_just,[status(thm)],[c_63]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(plus(X2,X1),X2) = real_zero )
| ~ int_less(int_zero,X1)
| ~ int_less(int_zero,X0)
| ~ int_leq(int_one,X2)
| ~ int_leq(X0,n)
| ~ int_leq(X2,X0)
| ~ int_leq(int_one,plus(X0,X1))
| ~ int_leq(plus(X0,X1),n) ),
inference(bin_hyper_res,[status(thm)],[c_65,c_81]) ).
tcf(c_325,definition,
iPr_def_10 = a(sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_326,negated_conjecture,
int_leq(sK1,n),
inference(demodulation,[status(thm)],[c_70]) ).
tcf(c_327,negated_conjecture,
int_less(sK2,sK1),
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_328,negated_conjecture,
int_leq(int_one,sK2),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_329,negated_conjecture,
iPr_def_10 != real_zero,
inference(demodulation,[status(thm)],[c_67,c_325]) ).
tcf(c_794,plain,
int_leq(sK2,sK1),
inference(superposition,[status(thm)],[c_327,c_49]) ).
tcf(c_802,plain,
int_less(int_zero,sK2),
inference(superposition,[status(thm)],[c_328,c_62]) ).
tcf(c_893,plain,
( int_less(sK1,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_326,c_51]) ).
tcf(c_927,plain,
! [X0: $i] :
( int_less(sK2,X0)
| ~ int_less(sK1,X0) ),
inference(superposition,[status(thm)],[c_327,c_52]) ).
tcf(c_928,plain,
! [X0: $i] :
( int_less(int_zero,X0)
| ~ int_less(sK2,X0) ),
inference(superposition,[status(thm)],[c_802,c_52]) ).
tcf(c_987,plain,
( int_less(sK2,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_893,c_927]) ).
tcf(c_1000,plain,
( int_less(int_zero,sK0(sK2,sK1))
| ~ int_less(sK2,sK1) ),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_1020,plain,
int_less(int_zero,sK1),
inference(superposition,[status(thm)],[c_327,c_928]) ).
tcf(c_1033,plain,
int_leq(int_one,sK1),
inference(superposition,[status(thm)],[c_1020,c_63]) ).
tcf(c_1051,plain,
( int_leq(sK2,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_987,c_49]) ).
tcf(c_1147,plain,
plus(sK2,sK0(sK2,sK1)) = sK1,
inference(superposition,[status(thm)],[c_327,c_60]) ).
tcf(c_1355,plain,
! [X0: $i] :
( ( a(plus(X0,sK0(sK2,sK1)),X0) = real_zero )
| ~ int_less(int_zero,sK2)
| ~ int_leq(sK2,n)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1))
| ~ int_leq(int_one,plus(sK2,sK0(sK2,sK1))) ),
inference(superposition,[status(thm)],[c_1147,c_141]) ).
tcf(c_1365,plain,
! [X0: $i] :
( ( a(plus(X0,sK0(sK2,sK1)),X0) = real_zero )
| ~ int_less(int_zero,sK2)
| ~ int_leq(sK2,n)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1)) ),
inference(light_normalisation,[status(thm)],[c_1355,c_1147]) ).
tcf(c_1366,plain,
! [X0: $i] :
( ( a(plus(X0,sK0(sK2,sK1)),X0) = real_zero )
| ~ int_leq(sK2,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2)
| ~ int_less(int_zero,sK0(sK2,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1365,c_802,c_326,c_1033]) ).
tcf(c_1380,plain,
! [X0: $i] :
( ( a(plus(X0,sK0(sK2,sK1)),X0) = real_zero )
| ~ int_leq(sK2,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK2) ),
inference(global_subsumption_just,[status(thm)],[c_1366,c_69,c_1000,c_1366]) ).
tcf(c_1396,plain,
( ( a(plus(sK2,sK0(sK2,sK1)),sK2) = real_zero )
| ~ int_leq(sK2,sK2)
| ~ int_leq(sK2,n) ),
inference(superposition,[status(thm)],[c_328,c_1380]) ).
tcf(c_1407,plain,
( ( real_zero = iPr_def_10 )
| ~ int_leq(sK2,sK2)
| ~ int_leq(sK2,n) ),
inference(light_normalisation,[status(thm)],[c_1396,c_325,c_1147]) ).
tcf(c_1408,plain,
( ( real_zero = iPr_def_10 )
| ~ int_leq(sK2,n) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1407,c_50]) ).
tcf(c_2015,plain,
( ( n = sK1 )
| ( real_zero = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_1051,c_1408]) ).
tcf(c_2640,plain,
( int_leq(sK2,n)
| ( real_zero = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2015,c_794]) ).
tcf(c_2642,plain,
( int_less(sK2,n)
| ( real_zero = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_2015,c_327]) ).
tcf(c_2747,plain,
real_zero = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_2642,c_1408,c_2640]) ).
tcf(c_2760,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_329,c_2747]) ).
tcf(c_2761,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_2760]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV487+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n005.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 19:54:05 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 0.74/1.28 % SZS status Started for theBenchmark.p
% 0.74/1.28 % SZS status Theorem for theBenchmark.p
% 0.74/1.28
% 0.74/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.74/1.28
% 0.74/1.28 % ------ iProver source info
% 0.74/1.28
% 0.74/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 0.74/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.74/1.28 % git: non_committed_changes: false
% 0.74/1.28
% 0.74/1.28 % ------ Parsing...
% 0.74/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.74/1.28
% 0.74/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.74/1.28
% 0.74/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.74/1.28
% 0.74/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.74/1.28 % ------ Proving...
% 0.74/1.28 % ------ Problem Properties
% 0.74/1.28
% 0.74/1.28 %
% 0.74/1.28 % clauses 23
% 0.74/1.28 % conjectures 4
% 0.74/1.28 % EPR 14
% 0.74/1.28 % Horn 21
% 0.74/1.28 % unary 11
% 0.74/1.28 % binary 7
% 0.74/1.28 % lits 50
% 0.74/1.28 % lits eq 9
% 0.74/1.28 % fd_pure 0
% 0.74/1.28 % fd_pseudo 0
% 0.74/1.28 % fd_cond 0
% 0.74/1.28 % fd_pseudo_cond 1
% 0.74/1.28 % AC symbols 0
% 0.74/1.28
% 0.74/1.28 % ------ Schedule dynamic 5 is on
% 0.74/1.28
% 0.74/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 % ------
% 0.74/1.28 % Current options:
% 0.74/1.28 % ------
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 %
% 0.74/1.28
% 0.74/1.28 % ------ Proving...
% 0.74/1.28 %
% 0.74/1.28
% 0.74/1.28 % SZS status Theorem for theBenchmark.p
% 0.74/1.28
% 0.74/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.74/1.28
% 0.74/1.28
%------------------------------------------------------------------------------