%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC315-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n018.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:09:16 PM UTC 2026
% Result : Unsatisfiable 4.44s 1.30s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 22
% Syntax : Number of formulae : 106 ( 31 unt; 0 def)
% Number of atoms : 252 ( 132 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 278 ( 132 ~; 146 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 56 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f98,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| nil != cons(X0,X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f125,axiom,
! [X0,X1] :
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/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(f183,axiom,
! [X2,X3,X0,X1] :
( X0 = X2
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X0)
| ~ ssItem(X2)
| cons(X0,X1) != cons(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause170) ).
fof(f184,axiom,
! [X2,X3,X0,X1] :
( X3 = X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X0)
| ~ ssItem(X2)
| cons(X0,X1) != cons(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
fof(f185,plain,
! [X2,X3,X0,X1] :
( X1 = X3
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X0)
| ~ ssItem(X2)
| cons(X0,X1) != cons(X2,X3) ),
inference(reorient_equations,[],[f184]) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
( nil = sk2
| sk2 = app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( nil = sk2
| sk1 != app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f212]) ).
fof(f214,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f215,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f216,plain,
( nil != sk1
| sk2 = app(cons(sk5,nil),sk6) ),
inference(reorient_equations,[],[f215]) ).
fof(f217,negated_conjecture,
( nil != sk1
| app(sk6,cons(sk5,nil)) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
( nil != sk1
| sk1 != app(sk6,cons(sk5,nil)) ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
fof(f220,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f221,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk7,nil),sk8) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f222,plain,
( ~ neq(sk4,nil)
| sk4 = app(cons(sk7,nil),sk8) ),
inference(reorient_equations,[],[f221]) ).
fof(f223,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk8,cons(sk7,nil)) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f224,plain,
( ~ neq(sk4,nil)
| sk3 = app(sk8,cons(sk7,nil)) ),
inference(reorient_equations,[],[f223]) ).
fof(f227,plain,
( nil = sk4
| ssItem(sk5) ),
inference(definition_unfolding,[],[f207,f204]) ).
fof(f228,plain,
( nil != sk3
| ssItem(sk5) ),
inference(definition_unfolding,[],[f208,f205]) ).
fof(f229,plain,
( nil = sk4
| ssList(sk6) ),
inference(definition_unfolding,[],[f209,f204]) ).
fof(f230,plain,
( nil = sk4
| sk4 = app(cons(sk5,nil),sk6) ),
inference(definition_unfolding,[],[f211,f204,f204]) ).
fof(f231,plain,
( nil = sk4
| sk3 != app(sk6,cons(sk5,nil)) ),
inference(definition_unfolding,[],[f213,f205,f204]) ).
fof(f232,plain,
( nil != sk3
| ssList(sk6) ),
inference(definition_unfolding,[],[f214,f205]) ).
fof(f233,plain,
( nil != sk3
| sk4 = app(cons(sk5,nil),sk6) ),
inference(definition_unfolding,[],[f216,f204,f205]) ).
fof(f234,plain,
( nil != sk3
| sk3 != app(sk6,cons(sk5,nil)) ),
inference(definition_unfolding,[],[f218,f205,f205]) ).
tcf(c_256,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_257,negated_conjecture,
( ( sk3 = nil )
| ( sk4 != nil ) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_258,negated_conjecture,
( ssItem(sk5)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_259,negated_conjecture,
( ssItem(sk5)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_260,negated_conjecture,
( ssList(sk6)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_261,negated_conjecture,
( ( sk4 = nil )
| ( app(cons(sk5,nil),sk6) = sk4 ) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_262,negated_conjecture,
( ( sk4 = nil )
| ( app(sk6,cons(sk5,nil)) != sk3 ) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_263,negated_conjecture,
( ssList(sk6)
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f232]) ).
tcf(c_264,negated_conjecture,
( ( app(cons(sk5,nil),sk6) = sk4 )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_265,negated_conjecture,
( ( sk3 != nil )
| ( app(sk6,cons(sk5,nil)) != sk3 ) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_266,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_267,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_268,negated_conjecture,
( ( app(cons(sk7,nil),sk8) = sk4 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_269,negated_conjecture,
( ( app(sk8,cons(sk7,nil)) = sk3 )
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_271,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
tcf(c_274,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_277,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X1)
| ( cons(X0,X1) != cons(X2,X3) ) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X1)
| ( cons(X0,X1) != cons(X2,X3) ) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_290,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_305,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_260,c_260,c_263,c_257]) ).
tcf(c_307,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_258,c_258,c_259,c_257]) ).
tcf(c_309,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_263,c_305]) ).
tcf(c_311,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_259,c_307]) ).
tcf(c_315,negated_conjecture,
app(cons(sk5,nil),sk6) = sk4,
inference(global_subsumption_just,[status(thm)],[c_261,c_257,c_261,c_264]) ).
tcf(c_317,negated_conjecture,
app(cons(sk5,nil),sk6) = sk4,
inference(global_subsumption_just,[status(thm)],[c_264,c_315]) ).
tcf(c_319,negated_conjecture,
app(sk6,cons(sk5,nil)) != sk3,
inference(global_subsumption_just,[status(thm)],[c_262,c_257,c_262,c_265]) ).
tcf(c_321,negated_conjecture,
app(sk6,cons(sk5,nil)) != sk3,
inference(global_subsumption_just,[status(thm)],[c_265,c_319]) ).
tcf(c_675,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(sk8,cons(sk7,nil)) = sk3 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_269,c_290]) ).
tcf(c_676,plain,
( ( sk4 = nil )
| ( app(sk8,cons(sk7,nil)) = sk3 )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_675]) ).
tcf(c_677,plain,
( ( sk4 = nil )
| ( app(sk8,cons(sk7,nil)) = sk3 ) ),
inference(global_subsumption_just,[status(thm)],[c_676,c_256,c_277,c_676]) ).
tcf(c_699,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(cons(sk7,nil),sk8) = sk4 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_268,c_290]) ).
tcf(c_700,plain,
( ( sk4 = nil )
| ( app(cons(sk7,nil),sk8) = sk4 )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_699]) ).
tcf(c_701,plain,
( ( sk4 = nil )
| ( app(cons(sk7,nil),sk8) = sk4 ) ),
inference(global_subsumption_just,[status(thm)],[c_700,c_256,c_277,c_700]) ).
tcf(c_723,plain,
! [X0: $i,X1: $i] :
( ssList(sk8)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_267,c_290]) ).
tcf(c_724,plain,
( ssList(sk8)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_723]) ).
tcf(c_725,plain,
( ssList(sk8)
| ( sk4 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_724,c_256,c_277,c_724]) ).
tcf(c_747,plain,
! [X0: $i,X1: $i] :
( ssItem(sk7)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_266,c_290]) ).
tcf(c_748,plain,
( ssItem(sk7)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(unflattening,[status(thm)],[c_747]) ).
tcf(c_749,plain,
( ssItem(sk7)
| ( sk4 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_748,c_256,c_277,c_748]) ).
tcf(c_1589,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sk6) = cons(X0,sk6) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_309,c_271]) ).
tcf(c_2181,plain,
app(cons(sk5,nil),sk6) = cons(sk5,sk6),
inference(superposition,[status(thm)],[c_311,c_1589]) ).
tcf(c_2183,plain,
cons(sk5,sk6) = sk4,
inference(light_normalisation,[status(thm)],[c_2181,c_317]) ).
tcf(c_2188,plain,
( ~ ssItem(sk5)
| ~ ssList(sk6)
| ( sk4 != nil ) ),
inference(superposition,[status(thm)],[c_2183,c_274]) ).
tcf(c_2190,plain,
sk4 != nil,
inference(forward_subsumption_resolution,[status(thm)],[c_2188,c_311,c_309]) ).
tcf(c_2195,plain,
ssItem(sk7),
inference(backward_subsumption_resolution,[status(thm)],[c_749,c_2190]) ).
tcf(c_2196,plain,
ssList(sk8),
inference(backward_subsumption_resolution,[status(thm)],[c_725,c_2190]) ).
tcf(c_2197,plain,
app(cons(sk7,nil),sk8) = sk4,
inference(backward_subsumption_resolution,[status(thm)],[c_701,c_2190]) ).
tcf(c_2198,plain,
app(sk8,cons(sk7,nil)) = sk3,
inference(backward_subsumption_resolution,[status(thm)],[c_677,c_2190]) ).
tcf(c_2403,plain,
! [X0: $i,X1: $i] :
( ( X1 = sk6 )
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sk4 ) ),
inference(superposition,[status(thm)],[c_2183,c_278]) ).
tcf(c_2406,plain,
! [X0: $i,X1: $i] :
( ( X1 = sk6 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sk4 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2403,c_311,c_309]) ).
tcf(c_2424,plain,
! [X0: $i,X1: $i] :
( ( X0 = sk5 )
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sk4 ) ),
inference(superposition,[status(thm)],[c_2183,c_279]) ).
tcf(c_2427,plain,
! [X0: $i,X1: $i] :
( ( X0 = sk5 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sk4 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2424,c_311,c_309]) ).
tcf(c_2433,plain,
app(cons(sk7,nil),sk6) = cons(sk7,sk6),
inference(superposition,[status(thm)],[c_2195,c_1589]) ).
tcf(c_2451,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sk8) = cons(X0,sk8) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_2196,c_271]) ).
tcf(c_2645,plain,
app(cons(sk7,nil),sk8) = cons(sk7,sk8),
inference(superposition,[status(thm)],[c_2195,c_2451]) ).
tcf(c_2646,plain,
cons(sk7,sk8) = sk4,
inference(light_normalisation,[status(thm)],[c_2645,c_2197]) ).
tcf(c_2925,plain,
( ( sk6 = sk8 )
| ~ ssItem(sk7)
| ~ ssList(sk8) ),
inference(superposition,[status(thm)],[c_2646,c_2406]) ).
tcf(c_2926,plain,
sk6 = sk8,
inference(forward_subsumption_resolution,[status(thm)],[c_2925,c_2195,c_2196]) ).
tcf(c_2932,plain,
app(sk6,cons(sk7,nil)) = sk3,
inference(demodulation,[status(thm)],[c_2198,c_2926]) ).
tcf(c_2933,plain,
app(cons(sk7,nil),sk6) = sk4,
inference(demodulation,[status(thm)],[c_2197,c_2926]) ).
tcf(c_2937,plain,
cons(sk7,sk6) = sk4,
inference(demodulation,[status(thm)],[c_2433,c_2933]) ).
tcf(c_2968,plain,
( ( sk5 = sk7 )
| ~ ssItem(sk7)
| ~ ssList(sk6) ),
inference(superposition,[status(thm)],[c_2937,c_2427]) ).
tcf(c_2977,plain,
sk5 = sk7,
inference(forward_subsumption_resolution,[status(thm)],[c_2968,c_2195,c_309]) ).
tcf(c_2984,plain,
app(sk6,cons(sk5,nil)) = sk3,
inference(light_normalisation,[status(thm)],[c_2932,c_2977]) ).
tcf(c_2985,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2984,c_321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC315-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 17:37:19 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 4.44/1.30 % SZS status Started for theBenchmark.p
% 4.44/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.44/1.30
% 4.44/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.44/1.30
% 4.44/1.30 % ------ iProver source info
% 4.44/1.30
% 4.44/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.44/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.44/1.30 % git: non_committed_changes: false
% 4.44/1.30
% 4.44/1.30 % ------ Parsing...% successful
% 4.44/1.30
% 4.44/1.30
% 4.44/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.44/1.30
% 4.44/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 4.44/1.30
% 4.44/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.44/1.30
% 4.44/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.44/1.30 % ------ Proving...
% 4.44/1.30 % ------ Problem Properties
% 4.44/1.30
% 4.44/1.30 %
% 4.44/1.30 % clauses 28
% 4.44/1.30 % conjectures 7
% 4.44/1.30 % EPR 8
% 4.44/1.30 % Horn 24
% 4.44/1.30 % unary 8
% 4.44/1.30 % binary 7
% 4.44/1.30 % lits 75
% 4.44/1.30 % lits eq 30
% 4.44/1.30 % fd_pure 0
% 4.44/1.30 % fd_pseudo 0
% 4.44/1.30 % fd_cond 2
% 4.44/1.30 % fd_pseudo_cond 4
% 4.44/1.30 % AC symbols 0
% 4.44/1.30
% 4.44/1.30 % ------ Schedule dynamic 5 is on
% 4.44/1.30
% 4.44/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.44/1.30
% 4.44/1.30
% 4.44/1.30 % ------
% 4.44/1.30 % Current options:
% 4.44/1.30 % ------
% 4.44/1.30
% 4.44/1.30
% 4.44/1.30 %
% 4.44/1.30
% 4.44/1.30 % ------ Proving...
% 4.44/1.30 %
% 4.44/1.30
% 4.44/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 4.44/1.30
% 4.44/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.44/1.30
% 4.44/1.30
%------------------------------------------------------------------------------