%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC238-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n012.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:08:58 PM UTC 2026
% Result : Unsatisfiable 138.18s 34.73s
% Output : CNFRefutation 138.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 79 ( 17 unt; 0 def)
% Number of atoms : 232 ( 69 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 314 ( 161 ~; 153 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 114 ( 0 sgn 114 !; 0 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f71,axiom,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f72,axiom,
! [X0,X1] :
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f77,axiom,
! [X0] :
( nil = X0
| ssList(tl(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause77) ).
fof(f78,axiom,
! [X0] :
( nil = X0
| ssItem(hd(X0))
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause78) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f107,axiom,
! [X0] :
( nil = X0
| cons(hd(X0),tl(X0)) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
fof(f125,axiom,
! [X0,X1] :
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
fof(f126,plain,
! [X0,X1] :
( cons(X0,X1) = app(cons(X0,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f125]) ).
fof(f193,axiom,
! [X2,X3,X0,X1,X4] :
( ~ ssList(X4)
| ~ duplicatefreeP(X4)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f209,negated_conjecture,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f209]) ).
fof(f222,negated_conjecture,
! [X2,X3,X0,X1] :
( ~ lt(X0,X2)
| app(cons(X2,nil),X3) != sk3
| ~ ssList(X3)
| ~ ssItem(X2)
| app(X1,cons(X0,nil)) != sk6
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f223,plain,
! [X2,X3,X0,X1] :
( ~ lt(X0,X2)
| sk3 != app(cons(X2,nil),X3)
| ~ ssList(X3)
| ~ ssItem(X2)
| app(X1,cons(X0,nil)) != sk6
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f222]) ).
fof(f229,plain,
nil != sk3,
inference(definition_unfolding,[],[f206,f205]) ).
fof(f231,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f252,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f193]) ).
tcf(c_260,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_323,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_324,plain,
! [X0: $i,X1: $i] :
( duplicatefreeP(X0)
| ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_326,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_329,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_330,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_337,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_356,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(hd(X0),tl(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_372,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_431,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(cnf_transformation,[],[f252]) ).
tcf(c_440,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_442,negated_conjecture,
sk3 != nil,
inference(cnf_transformation,[],[f229]) ).
tcf(c_444,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_452,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X0)
| ~ lt(X1,X2)
| ( app(X0,cons(X1,nil)) != sk6 )
| ( app(cons(X2,nil),X3) != sk3 ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_6765,plain,
! [X0: $i] :
( ~ iPr_def_10
| ssItem(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_324]) ).
tcf(c_6766,plain,
! [X0: $i] :
( ~ iPr_def_11
| ~ ssList(X0)
| duplicatefreeP(X0) ),
inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_11])],[c_324]) ).
tcf(c_6767,plain,
( iPr_def_11
| iPr_def_10 ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_324]) ).
tcf(c_6770,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssItem(X3)
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ lt(X3,X0)
| ( app(X2,cons(X3,nil)) != sk6 )
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(demodulation,[status(thm)],[c_452]) ).
tcf(c_6774,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(demodulation,[status(thm)],[c_444]) ).
tcf(c_6776,negated_conjecture,
sk3 != nil,
inference(demodulation,[status(thm)],[c_442]) ).
tcf(c_6783,negated_conjecture,
ssList(sk3),
inference(demodulation,[status(thm)],[c_440]) ).
tcf(c_6784,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_6786,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_11192,plain,
( ( sk3 = nil )
| ( cons(hd(sk3),tl(sk3)) = sk3 ) ),
inference(superposition,[status(thm)],[c_6783,c_356]) ).
tcf(c_11236,plain,
cons(hd(sk3),tl(sk3)) = sk3,
inference(forward_subsumption_resolution,[status(thm)],[c_11192,c_6776]) ).
tcf(c_11521,plain,
( ssList(tl(sk3))
| ( sk3 = nil )
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_329]) ).
tcf(c_11522,plain,
( ssItem(hd(sk3))
| ( sk3 = nil )
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_330]) ).
tcf(c_15728,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sk3))
| ~ duplicatefreeP(app(app(X0,cons(hd(sk3),X1)),cons(hd(sk3),X2)))
| ~ ssList(app(app(X0,cons(hd(sk3),X1)),cons(hd(sk3),X2))) ),
inference(instantiation,[status(thm)],[c_431]) ).
tcf(c_15745,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk3))
| ~ duplicatefreeP(app(app(nil,cons(hd(sk3),nil)),cons(hd(sk3),nil)))
| ~ ssList(app(app(nil,cons(hd(sk3),nil)),cons(hd(sk3),nil))) ),
inference(instantiation,[status(thm)],[c_15728]) ).
tcf(c_17556,plain,
sk3 = sk3,
inference(instantiation,[status(thm)],[c_6784]) ).
tcf(c_17557,plain,
! [X0: $i,X1: $i] :
( ( sk3 = X0 )
| ( sk3 != X1 )
| ( X0 != X1 ) ),
inference(instantiation,[status(thm)],[c_6786]) ).
tcf(c_37867,plain,
! [X0: $i] :
( ( sk3 = X0 )
| ( sk3 != sk3 )
| ( X0 != sk3 ) ),
inference(instantiation,[status(thm)],[c_17557]) ).
tcf(c_44411,plain,
( ssList(cons(hd(sk3),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sk3)) ),
inference(instantiation,[status(thm)],[c_338]) ).
tcf(c_46205,plain,
! [X0: $i] :
( ssList(app(X0,cons(hd(sk3),nil)))
| ~ ssList(X0)
| ~ ssList(cons(hd(sk3),nil)) ),
inference(instantiation,[status(thm)],[c_337]) ).
tcf(c_46206,plain,
( ssList(app(nil,cons(hd(sk3),nil)))
| ~ ssList(nil)
| ~ ssList(cons(hd(sk3),nil)) ),
inference(instantiation,[status(thm)],[c_46205]) ).
tcf(c_62302,plain,
! [X0: $i,X1: $i,X2: $i] :
( ssList(app(app(X0,cons(hd(sk3),X1)),cons(hd(sk3),X2)))
| ~ ssList(cons(hd(sk3),X2))
| ~ ssList(app(X0,cons(hd(sk3),X1))) ),
inference(instantiation,[status(thm)],[c_337]) ).
tcf(c_62303,plain,
( ssList(app(app(nil,cons(hd(sk3),nil)),cons(hd(sk3),nil)))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(app(nil,cons(hd(sk3),nil))) ),
inference(instantiation,[status(thm)],[c_62302]) ).
tcf(c_162879,plain,
( ( sk3 = cons(hd(sk3),tl(sk3)) )
| ( sk3 != sk3 )
| ( cons(hd(sk3),tl(sk3)) != sk3 ) ),
inference(instantiation,[status(thm)],[c_37867]) ).
tcf(c_164462,plain,
! [X0: $i,X1: $i,X2: $i] :
( duplicatefreeP(app(app(X0,cons(hd(sk3),X1)),cons(hd(sk3),X2)))
| ~ iPr_def_11
| ~ ssList(app(app(X0,cons(hd(sk3),X1)),cons(hd(sk3),X2))) ),
inference(instantiation,[status(thm)],[c_6766]) ).
tcf(c_164463,plain,
( duplicatefreeP(app(app(nil,cons(hd(sk3),nil)),cons(hd(sk3),nil)))
| ~ iPr_def_11
| ~ ssList(app(app(nil,cons(hd(sk3),nil)),cons(hd(sk3),nil))) ),
inference(instantiation,[status(thm)],[c_164462]) ).
tcf(c_190308,plain,
( ( app(cons(hd(sk3),nil),tl(sk3)) = cons(hd(sk3),tl(sk3)) )
| ~ ssItem(hd(sk3))
| ~ ssList(tl(sk3)) ),
inference(instantiation,[status(thm)],[c_372]) ).
tcf(c_224246,plain,
! [X0: $i] : ssItem(X0),
inference(global_subsumption_just,[status(thm)],[c_6765,c_440,c_260,c_442,c_6765,c_6767,c_11522,c_15745,c_44411,c_46206,c_62303,c_164463]) ).
tcf(c_224254,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_6774,c_224246]) ).
tcf(c_224420,plain,
! [X0: $i] : ~ memberP(nil,X0),
inference(global_subsumption_just,[status(thm)],[c_323,c_440,c_260,c_442,c_323,c_6765,c_6767,c_11522,c_15745,c_44411,c_46206,c_62303,c_164463]) ).
tcf(c_224520,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_338,c_224246]) ).
tcf(c_224527,plain,
! [X0: $i,X1: $i] :
( ( app(nil,cons(X1,X0)) = cons(X1,X0) )
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_224520,c_326]) ).
tcf(c_470774,plain,
! [X0: $i] : app(nil,cons(X0,nil)) = cons(X0,nil),
inference(superposition,[status(thm)],[c_260,c_224527]) ).
tcf(c_471704,plain,
! [X0: $i,X1: $i] :
( memberP(nil,sk5(X1,nil,X0))
| ~ ssList(nil)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(superposition,[status(thm)],[c_470774,c_224254]) ).
tcf(c_471756,plain,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_471704,c_224420,c_260]) ).
tcf(c_500053,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( app(cons(X0,nil),X1) = sk3 )
| ( sk3 != X2 )
| ( app(cons(X0,nil),X1) != X2 ) ),
inference(instantiation,[status(thm)],[c_6786]) ).
tcf(c_555833,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) = sk3 )
| ( sk3 != cons(hd(sk3),tl(sk3)) )
| ( app(cons(X0,nil),X1) != cons(hd(sk3),tl(sk3)) ) ),
inference(instantiation,[status(thm)],[c_500053]) ).
tcf(c_569362,plain,
( ( app(cons(hd(sk3),nil),tl(sk3)) = sk3 )
| ( sk3 != cons(hd(sk3),tl(sk3)) )
| ( app(cons(hd(sk3),nil),tl(sk3)) != cons(hd(sk3),tl(sk3)) ) ),
inference(instantiation,[status(thm)],[c_555833]) ).
tcf(c_647196,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X0,nil),X1) != sk3 )
| ~ ssList(X1) ),
inference(global_subsumption_just,[status(thm)],[c_6770,c_471756]) ).
tcf(c_647197,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sk3 ) ),
inference(renaming,[status(thm)],[c_647196]) ).
tcf(c_669423,plain,
( ~ ssList(tl(sk3))
| ( app(cons(hd(sk3),nil),tl(sk3)) != sk3 ) ),
inference(instantiation,[status(thm)],[c_647197]) ).
tcf(c_669424,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_669423,c_569362,c_190308,c_162879,c_17556,c_11522,c_11521,c_11236,c_442,c_440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC238-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Thu Sep 24 17:09:20 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.32 Running first-order theorem proving
% 0.03/0.32 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.03/0.32
% 0.03/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.03/0.32
% 0.03/0.32 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 138.18/34.73 % SZS status Started for theBenchmark.p
% 138.18/34.73 % SZS status Unsatisfiable for theBenchmark.p
% 138.18/34.73
% 138.18/34.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 138.18/34.73
% 138.18/34.73 % ------ iProver source info
% 138.18/34.73
% 138.18/34.73 % git: date: 2026-07-19 20:42:38 +0200
% 138.18/34.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 138.18/34.73 % git: non_committed_changes: false
% 138.18/34.73
% 138.18/34.73 % ------ Parsing...% successful
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 138.18/34.73
% 138.18/34.73 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 138.18/34.73
% 138.18/34.73 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 138.18/34.73
% 138.18/34.73 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 138.18/34.73 % ------ Proving...
% 138.18/34.73 % ------ Problem Properties
% 138.18/34.73
% 138.18/34.73 %
% 138.18/34.73 % clauses 193
% 138.18/34.73 % conjectures 14
% 138.18/34.73 % EPR 59
% 138.18/34.73 % Horn 165
% 138.18/34.73 % unary 67
% 138.18/34.73 % binary 21
% 138.18/34.73 % lits 589
% 138.18/34.73 % lits eq 82
% 138.18/34.73 % fd_pure 0
% 138.18/34.73 % fd_pseudo 0
% 138.18/34.73 % fd_cond 15
% 138.18/34.73 % fd_pseudo_cond 14
% 138.18/34.73 % AC symbols 0
% 138.18/34.73
% 138.18/34.73 % ------ Schedule dynamic 5 is on
% 138.18/34.73
% 138.18/34.73 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 % ------
% 138.18/34.73 % Current options:
% 138.18/34.73 % ------
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 %
% 138.18/34.73
% 138.18/34.73 % ------ Proving...
% 138.18/34.73 % Proof_search_loop: time out after: 10609 full_loop iterations
% 138.18/34.73
% 138.18/34.73 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 % ------
% 138.18/34.73 % Current options:
% 138.18/34.73 % ------
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 %
% 138.18/34.73
% 138.18/34.73 % ------ Proving...
% 138.18/34.73 % Proof_search_loop: time out after: 12220 full_loop iterations
% 138.18/34.73
% 138.18/34.73 % ------ Option_1: Negative Selections Time Limit: 35.
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 % ------
% 138.18/34.73 % Current options:
% 138.18/34.73 % ------
% 138.18/34.73
% 138.18/34.73
% 138.18/34.73 %
% 138.18/34.73
% 138.18/34.73 % ------ Proving...
% 138.18/34.73 %
% 138.18/34.73
% 138.18/34.73 % SZS status Unsatisfiable for theBenchmark.p
% 138.18/34.73
% 138.18/34.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 138.18/34.74
% 138.18/34.74
%------------------------------------------------------------------------------