%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV486+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 : n008.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:22 PM UTC 2026
% Result : Theorem 4.12s 1.12s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 72 ( 19 unt; 0 def)
% Number of atoms : 259 ( 57 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 314 ( 127 ~; 127 |; 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 : 4 ( 2 usr; 1 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_less(int_zero,X2) )
=> ! [X3] :
( ( int_leq(X3,X0)
& int_leq(int_one,X3) )
=> a(X3,plus(X3,X2)) = real_zero ) )
& ! [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) = qr(plus(X3,X2),X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qih) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lt) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0) )
=> 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_less(int_zero,X4) )
=> ! [X5] :
( ( int_leq(X5,X0)
& int_leq(int_one,X5) )
=> real_zero = a(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) = qr(plus(X3,X2),X3) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,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_less(int_zero,X4)
| ! [X5] :
( ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| real_zero = a(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) = qr(plus(X3,X2),X3) ) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,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_less(int_zero,X4)
| ! [X5] :
( ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| real_zero = a(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) = qr(plus(X3,X2),X3) ) ) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
? [X0,X1] :
( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0)
& real_zero != a(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
? [X0,X1] :
( int_leq(X1,n)
& int_less(X0,X1)
& int_leq(int_one,X0)
& real_zero != a(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
( int_leq(sK1,n)
& int_less(sK0,sK1)
& int_leq(int_one,sK0)
& real_zero != a(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f19]) ).
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(nnf_transformation,[],[f1]) ).
fof(f27,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,[],[f26]) ).
fof(f28,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(f29,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(f30,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,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ int_less(X0,X1)
| ( int_less(int_zero,sK2(X0,X1))
& plus(X0,sK2(X0,X1)) = X1 ) )
& ( ! [X2] :
( ~ int_less(int_zero,X2)
| plus(X0,X2) != X1 )
| int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f30]) ).
fof(f32,plain,
! [X0,X1,X4,X5] :
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| plus(X0,X4) != X1
| ~ int_less(int_zero,X4)
| ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| real_zero = a(X5,plus(X5,X4)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
int_less(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f39,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f40,plain,
! [X0,X1] :
( X0 != X1
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f42,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f43,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f44,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_less(int_zero,sK2(X0,X1)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f45,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| plus(X0,sK2(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f54,plain,
! [X0,X4,X5] :
( ~ int_leq(plus(X0,X4),n)
| ~ int_leq(int_one,plus(X0,X4))
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X0)
| ~ int_less(int_zero,X4)
| ~ int_leq(X5,X0)
| ~ int_leq(int_one,X5)
| real_zero = a(X5,plus(X5,X4)) ),
inference(equality_resolution,[],[f32]) ).
fof(f56,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f40]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(X2,plus(X2,X1)) = 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,[],[f54]) ).
tcf(c_51,negated_conjecture,
a(sK0,sK1) != real_zero,
inference(cnf_transformation,[],[f37]) ).
tcf(c_52,negated_conjecture,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f36]) ).
tcf(c_53,negated_conjecture,
int_less(sK0,sK1),
inference(cnf_transformation,[],[f35]) ).
tcf(c_54,negated_conjecture,
int_leq(sK1,n),
inference(cnf_transformation,[],[f34]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( int_leq(X0,X1)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_57,plain,
! [X0: $i] : int_leq(X0,X0),
inference(cnf_transformation,[],[f56]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( int_less(X0,X1)
| ( X0 = X1 )
| ~ int_leq(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_59,plain,
! [X0: $i] :
( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_60,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( ( plus(X0,sK2(X0,X1)) = X1 )
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] :
( int_less(X2,X1)
| ~ int_less(X2,X0)
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_80,plain,
! [X0: $i] :
( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( a(X2,plus(X2,X1)) = 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_50,c_80]) ).
tcf(c_783,plain,
int_leq(sK0,sK1),
inference(superposition,[status(thm)],[c_53,c_56]) ).
tcf(c_792,plain,
int_less(int_zero,sK0),
inference(superposition,[status(thm)],[c_52,c_59]) ).
tcf(c_946,plain,
( int_less(sK1,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_54,c_58]) ).
tcf(c_978,plain,
! [X0: $i] :
( int_less(X0,sK1)
| ~ int_less(X0,sK0) ),
inference(superposition,[status(thm)],[c_53,c_68]) ).
tcf(c_1008,plain,
( int_less(int_zero,sK2(sK0,sK1))
| ~ int_less(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_1027,plain,
! [X0: $i] :
( int_less(X0,n)
| ( n = sK1 )
| ~ int_less(X0,sK1) ),
inference(superposition,[status(thm)],[c_946,c_68]) ).
tcf(c_1039,plain,
int_less(int_zero,sK1),
inference(superposition,[status(thm)],[c_792,c_978]) ).
tcf(c_1049,plain,
int_leq(int_one,sK1),
inference(superposition,[status(thm)],[c_1039,c_60]) ).
tcf(c_1111,plain,
( int_less(sK0,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_53,c_1027]) ).
tcf(c_1149,plain,
( int_leq(sK0,n)
| ( n = sK1 ) ),
inference(superposition,[status(thm)],[c_1111,c_56]) ).
tcf(c_1253,plain,
plus(sK0,sK2(sK0,sK1)) = sK1,
inference(superposition,[status(thm)],[c_53,c_62]) ).
tcf(c_1499,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK2(sK0,sK1))) = real_zero )
| ~ int_less(int_zero,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK0)
| ~ int_less(int_zero,sK2(sK0,sK1))
| ~ int_leq(int_one,plus(sK0,sK2(sK0,sK1))) ),
inference(superposition,[status(thm)],[c_1253,c_139]) ).
tcf(c_1510,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK2(sK0,sK1))) = real_zero )
| ~ int_less(int_zero,sK0)
| ~ int_leq(sK1,n)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK0)
| ~ int_less(int_zero,sK2(sK0,sK1)) ),
inference(light_normalisation,[status(thm)],[c_1499,c_1253]) ).
tcf(c_1511,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK2(sK0,sK1))) = real_zero )
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK0)
| ~ int_less(int_zero,sK2(sK0,sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1510,c_792,c_54,c_1049]) ).
tcf(c_1528,plain,
! [X0: $i] :
( ( a(X0,plus(X0,sK2(sK0,sK1))) = real_zero )
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK0) ),
inference(global_subsumption_just,[status(thm)],[c_1511,c_53,c_1008,c_1511]) ).
tcf(c_1540,plain,
( ( a(sK0,plus(sK0,sK2(sK0,sK1))) = real_zero )
| ~ int_leq(sK0,sK0)
| ~ int_leq(sK0,n) ),
inference(superposition,[status(thm)],[c_52,c_1528]) ).
tcf(c_1555,plain,
( ( a(sK0,sK1) = real_zero )
| ~ int_leq(sK0,sK0)
| ~ int_leq(sK0,n) ),
inference(light_normalisation,[status(thm)],[c_1540,c_1253]) ).
tcf(c_1556,plain,
~ int_leq(sK0,n),
inference(forward_subsumption_resolution,[status(thm)],[c_1555,c_51,c_57]) ).
tcf(c_1557,plain,
n = sK1,
inference(backward_subsumption_resolution,[status(thm)],[c_1149,c_1556]) ).
tcf(c_1567,plain,
int_leq(sK0,n),
inference(demodulation,[status(thm)],[c_783,c_1557]) ).
tcf(c_1581,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1556,c_1567]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+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.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Thu Sep 24 19:53:40 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 4.12/1.12 % SZS status Started for theBenchmark.p
% 4.12/1.12 % SZS status Theorem for theBenchmark.p
% 4.12/1.12
% 4.12/1.12 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.12/1.12
% 4.12/1.12 % ------ iProver source info
% 4.12/1.12
% 4.12/1.12 % git: date: 2026-07-19 20:42:38 +0200
% 4.12/1.12 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.12/1.12 % git: non_committed_changes: false
% 4.12/1.12
% 4.12/1.12 % ------ Parsing...
% 4.12/1.12 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.12/1.12
% 4.12/1.12 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.12/1.12
% 4.12/1.12 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.12/1.12
% 4.12/1.12 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.12/1.12 % ------ Proving...
% 4.12/1.12 % ------ Problem Properties
% 4.12/1.12
% 4.12/1.12 %
% 4.12/1.12 % clauses 21
% 4.12/1.12 % conjectures 4
% 4.12/1.12 % EPR 12
% 4.12/1.12 % Horn 19
% 4.12/1.12 % unary 9
% 4.12/1.12 % binary 7
% 4.12/1.12 % lits 48
% 4.12/1.12 % lits eq 7
% 4.12/1.12 % fd_pure 0
% 4.12/1.12 % fd_pseudo 0
% 4.12/1.12 % fd_cond 0
% 4.12/1.12 % fd_pseudo_cond 1
% 4.12/1.12 % AC symbols 0
% 4.12/1.12
% 4.12/1.12 % ------ Schedule dynamic 5 is on
% 4.12/1.12
% 4.12/1.12 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.12/1.12
% 4.12/1.12
% 4.12/1.12 % ------
% 4.12/1.12 % Current options:
% 4.12/1.12 % ------
% 4.12/1.12
% 4.12/1.12
% 4.12/1.12 %
% 4.12/1.12
% 4.12/1.12 % ------ Proving...
% 4.12/1.12 %
% 4.12/1.12
% 4.12/1.12 % SZS status Theorem for theBenchmark.p
% 4.12/1.12
% 4.12/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.12/1.12
% 4.12/1.12
%------------------------------------------------------------------------------