%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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:53 PM UTC 2026
% Result : Theorem 14.67s 2.83s
% Output : CNFRefutation 14.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 80 ( 23 unt; 3 def)
% Number of atoms : 232 ( 42 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 200 ( 94 ~; 81 |; 16 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 192 ( 0 sgn 190 !; 2 ?; 91 :)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0,X1,X2,X3] : app(X0,X1,X2) != lam(X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_021) ).
fof(f23,axiom,
! [X0,X1] : lam(X0) != var(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_023) ).
fof(f24,axiom,
! [X0,X1,X2] :
( X0 != lam(proj1Lam(X0))
=> ( nf(app(X0,X1,X2))
<=> ( nf(X1)
& nf(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_024) ).
fof(f26,axiom,
! [X0] :
( nf(lam(X0))
<=> nf(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_026) ).
fof(f27,axiom,
! [X0] : nf(var(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_027) ).
fof(f29,axiom,
! [X0,X1] : index(cons(X0,X1),zero) = just(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_029) ).
fof(f30,axiom,
! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_030) ).
fof(f31,axiom,
! [X0,X1,X2,X3,X4] :
( tc(X0,app(X2,X3,X4),X1)
<=> ( tc(X0,X3,X4)
& tc(X0,X2,arr(X4,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_031) ).
fof(f33,axiom,
! [X0,X1,X2,X3] :
( tc(X0,lam(X1),arr(X2,X3))
<=> tc(cons(X2,X0),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_033) ).
fof(f35,axiom,
! [X0,X1,X2,X3] :
( index(X0,X2) = just(X3)
=> ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_035) ).
fof(f36,conjecture,
? [X0] :
( tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_036) ).
fof(f37,negated_conjecture,
~ ? [X0] :
( tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
& nf(X0) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( lam(proj1Lam(X0)) = X0
| ( nf(app(X0,X1,X2))
<=> ( nf(X1)
& nf(X0) ) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f41,plain,
! [X0,X1,X2,X3] :
( index(X0,X2) != just(X3)
| ( tc(X0,var(X2),X1)
<=> X3 = X1 ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f42,plain,
! [X0] :
( ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
| ~ nf(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f43,plain,
! [X0,X1,X2] :
( lam(proj1Lam(X0)) = X0
| ( ( ~ nf(app(X0,X1,X2))
| ( nf(X1)
& nf(X0) ) )
& ( ~ nf(X1)
| ~ nf(X0)
| nf(app(X0,X1,X2)) ) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f44,plain,
! [X0,X1,X2] :
( lam(proj1Lam(X0)) = X0
| ( ( ~ nf(app(X0,X1,X2))
| ( nf(X1)
& nf(X0) ) )
& ( ~ nf(X1)
| ~ nf(X0)
| nf(app(X0,X1,X2)) ) ) ),
inference(flattening,[],[f43]) ).
fof(f45,plain,
! [X0] :
( ( ~ nf(lam(X0))
| nf(X0) )
& ( ~ nf(X0)
| nf(lam(X0)) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f46,plain,
! [X0,X1,X2,X3,X4] :
( ( ~ tc(X0,app(X2,X3,X4),X1)
| ( tc(X0,X3,X4)
& tc(X0,X2,arr(X4,X1)) ) )
& ( ~ tc(X0,X3,X4)
| ~ tc(X0,X2,arr(X4,X1))
| tc(X0,app(X2,X3,X4),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f47,plain,
! [X0,X1,X2,X3,X4] :
( ( ~ tc(X0,app(X2,X3,X4),X1)
| ( tc(X0,X3,X4)
& tc(X0,X2,arr(X4,X1)) ) )
& ( ~ tc(X0,X3,X4)
| ~ tc(X0,X2,arr(X4,X1))
| tc(X0,app(X2,X3,X4),X1) ) ),
inference(flattening,[],[f46]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( ( ~ tc(X0,lam(X1),arr(X2,X3))
| tc(cons(X2,X0),X1,X3) )
& ( ~ tc(cons(X2,X0),X1,X3)
| tc(X0,lam(X1),arr(X2,X3)) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f49,plain,
! [X0,X1,X2,X3] :
( index(X0,X2) != just(X3)
| ( ( ~ tc(X0,var(X2),X1)
| X3 = X1 )
& ( X1 != X3
| tc(X0,var(X2),X1) ) ) ),
inference(nnf_transformation,[],[f41]) ).
fof(f70,plain,
! [X2,X3,X0,X1] : app(X0,X1,X2) != lam(X3),
inference(cnf_transformation,[],[f21]) ).
fof(f72,plain,
! [X0,X1] : lam(X0) != var(X1),
inference(cnf_transformation,[],[f23]) ).
fof(f75,plain,
! [X2,X0,X1] :
( lam(proj1Lam(X0)) = X0
| ~ nf(X1)
| ~ nf(X0)
| nf(app(X0,X1,X2)) ),
inference(cnf_transformation,[],[f44]) ).
fof(f78,plain,
! [X0] :
( ~ nf(X0)
| nf(lam(X0)) ),
inference(cnf_transformation,[],[f45]) ).
fof(f79,plain,
! [X0] : nf(var(X0)),
inference(cnf_transformation,[],[f27]) ).
fof(f81,plain,
! [X0,X1] : just(X0) = index(cons(X0,X1),zero),
inference(cnf_transformation,[],[f29]) ).
fof(f82,plain,
! [X2,X0,X1] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
inference(cnf_transformation,[],[f30]) ).
fof(f85,plain,
! [X2,X3,X0,X1,X4] :
( ~ tc(X0,X3,X4)
| ~ tc(X0,X2,arr(X4,X1))
| tc(X0,app(X2,X3,X4),X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f87,plain,
! [X2,X3,X0,X1] :
( ~ tc(X0,lam(X1),arr(X2,X3))
| tc(cons(X2,X0),X1,X3) ),
inference(cnf_transformation,[],[f48]) ).
fof(f88,plain,
! [X2,X3,X0,X1] :
( ~ tc(cons(X2,X0),X1,X3)
| tc(X0,lam(X1),arr(X2,X3)) ),
inference(cnf_transformation,[],[f48]) ).
fof(f91,plain,
! [X2,X3,X0,X1] :
( index(X0,X2) != just(X3)
| X1 != X3
| tc(X0,var(X2),X1) ),
inference(cnf_transformation,[],[f49]) ).
fof(f92,plain,
! [X0] :
( ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b)))
| ~ nf(X0) ),
inference(cnf_transformation,[],[f42]) ).
fof(f93,plain,
! [X2,X3,X0] :
( index(X0,X2) != just(X3)
| tc(X0,var(X2),X3) ),
inference(equality_resolution,[],[f91]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] : app(X0,X1,X2) != lam(X3),
inference(cnf_transformation,[],[f70]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : lam(X0) != var(X1),
inference(cnf_transformation,[],[f72]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( nf(app(X0,X1,X2))
| ( lam(proj1Lam(X0)) = X0 )
| ~ nf(X1)
| ~ nf(X0) ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_76,plain,
! [X0: $i] :
( nf(lam(X0))
| ~ nf(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_78,plain,
! [X0: $i] : nf(var(X0)),
inference(cnf_transformation,[],[f79]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] : index(cons(X0,X1),zero) = just(X0),
inference(cnf_transformation,[],[f81]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
inference(cnf_transformation,[],[f82]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( tc(X0,app(X1,X4,X2),X3)
| ~ tc(X0,X4,X2)
| ~ tc(X0,X1,arr(X2,X3)) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(X1,lam(X2),arr(X0,X3))
| ~ tc(cons(X0,X1),X2,X3) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_87,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(cons(X2,X0),X1,X3)
| ~ tc(X0,lam(X1),arr(X2,X3)) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i,X2: $i] :
( tc(X0,var(X1),X2)
| ( index(X0,X1) != just(X2) ) ),
inference(cnf_transformation,[],[f93]) ).
tcf(c_91,negated_conjecture,
! [X0: $i] :
( ~ nf(X0)
| ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))) ),
inference(cnf_transformation,[],[f92]) ).
tcf(c_443,definition,
iPr_def_10 = arr(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_444,definition,
iPr_def_11 = arr(a,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_445,definition,
iPr_def_12 = arr(iPr_def_11,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_446,negated_conjecture,
! [X0: $i] :
( ~ nf(X0)
| ~ tc(nil,X0,iPr_def_12) ),
inference(demodulation,[status(thm)],[c_91,c_443,c_444,c_445]) ).
tcf(c_1322,plain,
! [X0: $i,X1: $i,X2: $i] :
( tc(cons(X0,X2),var(zero),X1)
| ( just(X0) != just(X1) ) ),
inference(superposition,[status(thm)],[c_80,c_89]) ).
tcf(c_1323,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(cons(X3,X0),var(suc(X1)),X2)
| ( index(X0,X1) != just(X2) ) ),
inference(superposition,[status(thm)],[c_81,c_89]) ).
tcf(c_1354,plain,
! [X0: $i,X1: $i] :
( tc(X0,lam(X1),iPr_def_10)
| ~ tc(cons(a,X0),X1,b) ),
inference(superposition,[status(thm)],[c_443,c_86]) ).
tcf(c_1355,plain,
! [X0: $i,X1: $i] :
( tc(X0,lam(X1),iPr_def_11)
| ~ tc(cons(a,X0),X1,iPr_def_10) ),
inference(superposition,[status(thm)],[c_444,c_86]) ).
tcf(c_1356,plain,
! [X0: $i,X1: $i] :
( tc(X0,lam(X1),iPr_def_12)
| ~ tc(cons(iPr_def_11,X0),X1,iPr_def_10) ),
inference(superposition,[status(thm)],[c_445,c_86]) ).
tcf(c_1384,plain,
! [X0: $i,X1: $i] :
( tc(cons(a,X0),X1,iPr_def_10)
| ~ tc(X0,lam(X1),iPr_def_11) ),
inference(superposition,[status(thm)],[c_444,c_87]) ).
tcf(c_1431,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(X0,lam(app(X1,X3,X2)),iPr_def_10)
| ~ tc(cons(a,X0),X3,X2)
| ~ tc(cons(a,X0),X1,arr(X2,b)) ),
inference(superposition,[status(thm)],[c_82,c_1354]) ).
tcf(c_1432,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(X0,lam(app(X1,X3,X2)),iPr_def_11)
| ~ tc(cons(a,X0),X3,X2)
| ~ tc(cons(a,X0),X1,arr(X2,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_82,c_1355]) ).
tcf(c_1705,plain,
! [X0: $i,X1: $i] : tc(cons(X0,X1),var(zero),X0),
inference(equality_resolution,[status(thm)],[c_1322]) ).
tcf(c_2125,plain,
! [X0: $i,X1: $i,X2: $i] :
( tc(X0,lam(app(X1,X2,a)),iPr_def_10)
| ~ tc(cons(a,X0),X2,a)
| ~ tc(cons(a,X0),X1,iPr_def_10) ),
inference(superposition,[status(thm)],[c_443,c_1431]) ).
tcf(c_2150,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( tc(cons(X2,cons(X0,X3)),var(suc(zero)),X1)
| ( just(X0) != just(X1) ) ),
inference(superposition,[status(thm)],[c_80,c_1323]) ).
tcf(c_2641,plain,
! [X0: $i,X1: $i,X2: $i] : tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
inference(equality_resolution,[status(thm)],[c_2150]) ).
tcf(c_2673,plain,
! [X0: $i,X1: $i,X2: $i] :
( tc(cons(arr(X0,iPr_def_10),X1),lam(app(var(suc(zero)),X2,X0)),iPr_def_11)
| ~ tc(cons(a,cons(arr(X0,iPr_def_10),X1)),X2,X0) ),
inference(superposition,[status(thm)],[c_2641,c_1432]) ).
tcf(c_3446,plain,
! [X0: $i,X1: $i,X2: $i] :
( tc(X0,lam(lam(app(X1,X2,a))),iPr_def_12)
| ~ tc(cons(a,cons(iPr_def_11,X0)),X2,a)
| ~ tc(cons(a,cons(iPr_def_11,X0)),X1,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2125,c_1356]) ).
tcf(c_5837,plain,
! [X0: $i,X1: $i] :
( tc(cons(iPr_def_11,X0),lam(app(var(suc(zero)),X1,a)),iPr_def_11)
| ~ tc(cons(a,cons(arr(a,iPr_def_10),X0)),X1,a) ),
inference(superposition,[status(thm)],[c_444,c_2673]) ).
tcf(c_5846,plain,
! [X0: $i,X1: $i] :
( tc(cons(iPr_def_11,X0),lam(app(var(suc(zero)),X1,a)),iPr_def_11)
| ~ tc(cons(a,cons(iPr_def_11,X0)),X1,a) ),
inference(light_normalisation,[status(thm)],[c_5837,c_444]) ).
tcf(c_7590,plain,
! [X0: $i,X1: $i] :
( ~ nf(lam(lam(app(X0,X1,a))))
| ~ tc(cons(a,cons(iPr_def_11,nil)),X1,a)
| ~ tc(cons(a,cons(iPr_def_11,nil)),X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3446,c_446]) ).
tcf(c_7621,plain,
! [X0: $i] :
( ~ tc(cons(a,cons(iPr_def_11,nil)),X0,iPr_def_10)
| ~ nf(lam(lam(app(X0,var(zero),a)))) ),
inference(superposition,[status(thm)],[c_1705,c_7590]) ).
tcf(c_7681,plain,
! [X0: $i] :
( ~ tc(cons(iPr_def_11,nil),lam(X0),iPr_def_11)
| ~ nf(lam(lam(app(X0,var(zero),a)))) ),
inference(superposition,[status(thm)],[c_1384,c_7621]) ).
tcf(c_7734,plain,
! [X0: $i] :
( ~ tc(cons(iPr_def_11,nil),lam(X0),iPr_def_11)
| ~ nf(lam(app(X0,var(zero),a))) ),
inference(superposition,[status(thm)],[c_76,c_7681]) ).
tcf(c_7747,plain,
! [X0: $i] :
( ~ tc(cons(a,cons(iPr_def_11,nil)),X0,a)
| ~ nf(lam(app(app(var(suc(zero)),X0,a),var(zero),a))) ),
inference(superposition,[status(thm)],[c_5846,c_7734]) ).
tcf(c_8101,plain,
! [X0: $i] :
( ~ tc(cons(a,cons(iPr_def_11,nil)),X0,a)
| ~ nf(app(app(var(suc(zero)),X0,a),var(zero),a)) ),
inference(superposition,[status(thm)],[c_76,c_7747]) ).
tcf(c_8241,plain,
! [X0: $i] :
( ( lam(proj1Lam(app(var(suc(zero)),X0,a))) = app(var(suc(zero)),X0,a) )
| ~ nf(var(zero))
| ~ nf(app(var(suc(zero)),X0,a))
| ~ tc(cons(a,cons(iPr_def_11,nil)),X0,a) ),
inference(superposition,[status(thm)],[c_72,c_8101]) ).
tcf(c_8242,plain,
! [X0: $i] :
( ( lam(proj1Lam(app(var(suc(zero)),X0,a))) = app(var(suc(zero)),X0,a) )
| ~ nf(app(var(suc(zero)),X0,a))
| ~ tc(cons(a,cons(iPr_def_11,nil)),X0,a) ),
inference(forward_subsumption_resolution,[status(thm)],[c_8241,c_78]) ).
tcf(c_8835,plain,
( ( lam(proj1Lam(app(var(suc(zero)),var(zero),a))) = app(var(suc(zero)),var(zero),a) )
| ~ nf(app(var(suc(zero)),var(zero),a)) ),
inference(superposition,[status(thm)],[c_1705,c_8242]) ).
tcf(c_16122,plain,
( ( lam(proj1Lam(var(suc(zero)))) = var(suc(zero)) )
| ( lam(proj1Lam(app(var(suc(zero)),var(zero),a))) = app(var(suc(zero)),var(zero),a) )
| ~ nf(var(zero))
| ~ nf(var(suc(zero))) ),
inference(superposition,[status(thm)],[c_72,c_8835]) ).
tcf(c_16123,plain,
lam(proj1Lam(app(var(suc(zero)),var(zero),a))) = app(var(suc(zero)),var(zero),a),
inference(forward_subsumption_resolution,[status(thm)],[c_16122,c_71,c_78,c_78]) ).
tcf(c_16170,plain,
! [X0: $i,X1: $i,X2: $i] : app(var(suc(zero)),var(zero),a) != app(X0,X1,X2),
inference(superposition,[status(thm)],[c_16123,c_69]) ).
tcf(c_16887,plain,
$false,
inference(equality_resolution,[status(thm)],[c_16170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX223+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 23:44:18 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 14.67/2.83 % SZS status Started for theBenchmark.p
% 14.67/2.83 % SZS status Theorem for theBenchmark.p
% 14.67/2.83
% 14.67/2.83 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 14.67/2.83
% 14.67/2.83 % ------ iProver source info
% 14.67/2.83
% 14.67/2.83 % git: date: 2026-07-19 20:42:38 +0200
% 14.67/2.83 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 14.67/2.83 % git: non_committed_changes: false
% 14.67/2.83
% 14.67/2.83 % ------ Parsing...
% 14.67/2.83 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 14.67/2.83
% 14.67/2.83 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 14.67/2.83
% 14.67/2.83 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 14.67/2.83
% 14.67/2.83 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 14.67/2.83 % ------ Proving...
% 14.67/2.83 % ------ Problem Properties
% 14.67/2.83
% 14.67/2.83 %
% 14.67/2.83 % clauses 46
% 14.67/2.83 % conjectures 1
% 14.67/2.83 % EPR 4
% 14.67/2.83 % Horn 43
% 14.67/2.83 % unary 31
% 14.67/2.83 % binary 10
% 14.67/2.83 % lits 67
% 14.67/2.83 % lits eq 37
% 14.67/2.83 % fd_pure 0
% 14.67/2.83 % fd_pseudo 0
% 14.67/2.83 % fd_cond 0
% 14.67/2.83 % fd_pseudo_cond 1
% 14.67/2.83 % AC symbols 0
% 14.67/2.83
% 14.67/2.83 % ------ Schedule dynamic 5 is on
% 14.67/2.83
% 14.67/2.83 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 14.67/2.83
% 14.67/2.83
% 14.67/2.83 % ------
% 14.67/2.83 % Current options:
% 14.67/2.83 % ------
% 14.67/2.83
% 14.67/2.83
% 14.67/2.83 %
% 14.67/2.83
% 14.67/2.83 % ------ Proving...
% 14.67/2.83 %
% 14.67/2.83
% 14.67/2.83 % SZS status Theorem for theBenchmark.p
% 14.67/2.83
% 14.67/2.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 14.67/2.84
% 14.67/2.84
%------------------------------------------------------------------------------