%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC070+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 : 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:07:45 PM UTC 2026
% Result : Theorem 3.71s 6.23s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 80 ( 22 unt; 0 def)
% Number of atoms : 305 ( 79 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 380 ( 155 ~; 146 |; 61 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 73 !; 22 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f139,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f141,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f149,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f150,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X3] :
( app(X1,X3) = X0
& ssList(X3) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(rectify,[],[f149]) ).
fof(f151,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ( app(X1,sK8(X0,X1)) = X0
& ssList(sK8(X0,X1)) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1))],[f150]) ).
fof(f153,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f154,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(rectify,[],[f153]) ).
fof(f155,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f154]) ).
fof(f158,plain,
ssList(sK0),
inference(cnf_transformation,[],[f141]) ).
fof(f159,plain,
ssList(sK1),
inference(cnf_transformation,[],[f141]) ).
fof(f162,plain,
( frontsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f141]) ).
fof(f163,plain,
( neq(sK2,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f141]) ).
fof(f164,plain,
( frontsegP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f141]) ).
fof(f165,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f141]) ).
fof(f166,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f141]) ).
fof(f167,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f168,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f141]) ).
fof(f169,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f141]) ).
fof(f181,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f192,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| app(X1,sK8(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f151]) ).
fof(f193,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| ssList(sK8(X0,X1)) ),
inference(cnf_transformation,[],[f151]) ).
fof(f205,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f155]) ).
fof(f212,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f132]) ).
fof(f219,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f139]) ).
fof(f221,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f167,f169,f168]) ).
fof(f222,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f166,f169,f168]) ).
fof(f223,plain,
ssList(sK3),
inference(definition_unfolding,[],[f159,f169]) ).
fof(f224,plain,
ssList(sK2),
inference(definition_unfolding,[],[f158,f168]) ).
fof(f231,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f205]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_50,negated_conjecture,
( ( nil != sK2 )
| ( nil != sK3 ) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_51,negated_conjecture,
( neq(sK2,nil)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_52,negated_conjecture,
( frontsegP(sK3,sK2)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_53,negated_conjecture,
( neq(sK2,nil)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_54,negated_conjecture,
( frontsegP(sK3,sK2)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f162]) ).
tcf(c_57,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f223]) ).
tcf(c_58,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f224]) ).
tcf(c_70,plain,
ssList(nil),
inference(cnf_transformation,[],[f181]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( ssList(sK8(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( ( app(X1,sK8(X0,X1)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f231]) ).
tcf(c_101,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f212]) ).
tcf(c_108,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_146,negated_conjecture,
frontsegP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_54,c_54,c_52,c_50]) ).
tcf(c_148,negated_conjecture,
neq(sK2,nil),
inference(global_subsumption_just,[status(thm)],[c_53,c_53,c_51,c_50]) ).
tcf(c_150,negated_conjecture,
frontsegP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_52,c_146]) ).
tcf(c_152,negated_conjecture,
neq(sK2,nil),
inference(global_subsumption_just,[status(thm)],[c_51,c_148]) ).
tcf(c_893,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( nil != nil )
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_152]) ).
tcf(c_894,plain,
( ~ ssList(sK2)
| ~ segmentP(sK2,sK2)
| ~ segmentP(sK3,sK2) ),
inference(unflattening,[status(thm)],[c_893]) ).
tcf(c_895,plain,
( ~ segmentP(sK3,sK2)
| ~ segmentP(sK2,sK2) ),
inference(global_subsumption_just,[status(thm)],[c_894,c_58,c_894]) ).
tcf(c_896,plain,
( ~ segmentP(sK2,sK2)
| ~ segmentP(sK3,sK2) ),
inference(renaming,[status(thm)],[c_895]) ).
tcf(c_2507,plain,
app(sK2,nil) = sK2,
inference(superposition,[status(thm)],[c_58,c_101]) ).
tcf(c_2514,plain,
app(nil,sK2) = sK2,
inference(superposition,[status(thm)],[c_58,c_108]) ).
tcf(c_3072,plain,
( ( app(sK2,sK8(sK3,sK2)) = sK3 )
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_150,c_83]) ).
tcf(c_3093,plain,
app(sK2,sK8(sK3,sK2)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_3072,c_58,c_57]) ).
tcf(c_4826,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(sK2)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK2),X0)) ),
inference(superposition,[status(thm)],[c_2514,c_91]) ).
tcf(c_4847,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(sK2)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(light_normalisation,[status(thm)],[c_4826,c_2514]) ).
tcf(c_4848,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4847,c_58,c_70]) ).
tcf(c_5274,plain,
( segmentP(sK2,sK2)
| ~ ssList(nil)
| ~ ssList(app(sK2,nil)) ),
inference(superposition,[status(thm)],[c_2507,c_4848]) ).
tcf(c_5275,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK8(sK3,sK2))
| ~ ssList(app(sK2,sK8(sK3,sK2))) ),
inference(superposition,[status(thm)],[c_3093,c_4848]) ).
tcf(c_5280,plain,
( segmentP(sK2,sK2)
| ~ ssList(sK2)
| ~ ssList(nil) ),
inference(light_normalisation,[status(thm)],[c_5274,c_2507]) ).
tcf(c_5281,plain,
segmentP(sK2,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_5280,c_58,c_70]) ).
tcf(c_5282,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK3)
| ~ ssList(sK8(sK3,sK2)) ),
inference(light_normalisation,[status(thm)],[c_5275,c_3093]) ).
tcf(c_5283,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK8(sK3,sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5282,c_57]) ).
tcf(c_5301,plain,
~ segmentP(sK3,sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_896,c_5281]) ).
tcf(c_5302,plain,
~ ssList(sK8(sK3,sK2)),
inference(backward_subsumption_resolution,[status(thm)],[c_5283,c_5301]) ).
tcf(c_5725,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| ~ frontsegP(sK3,sK2) ),
inference(superposition,[status(thm)],[c_82,c_5302]) ).
tcf(c_5726,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5725,c_58,c_57,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC070+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.40 % Computer : n008.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Thu Sep 24 16:14:17 UTC 2026
% 0.13/5.41 % CPUTime :
% 0.13/5.41 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.44 Running first-order theorem proving
% 0.13/5.44 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.13/5.46
% 0.13/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.46
% 0.13/5.46 % Detected problem language: tptp
% 0.13/5.47 % Proving...
% 3.71/6.23 % SZS status Started for theBenchmark.p
% 3.71/6.23 % SZS status Theorem for theBenchmark.p
% 3.71/6.23
% 3.71/6.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.71/6.23
% 3.71/6.23 % ------ iProver source info
% 3.71/6.23
% 3.71/6.23 % git: date: 2026-07-19 20:42:38 +0200
% 3.71/6.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.71/6.23 % git: non_committed_changes: false
% 3.71/6.23
% 3.71/6.23 % ------ Parsing...
% 3.71/6.23 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.71/6.23
% 3.71/6.23 % ------ 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 %
% 3.71/6.23
% 3.71/6.23 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.71/6.23
% 3.71/6.23 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.71/6.23 % ------ Proving...
% 3.71/6.23 % ------ Problem Properties
% 3.71/6.23
% 3.71/6.23 %
% 3.71/6.23 % clauses 53
% 3.71/6.23 % conjectures 3
% 3.71/6.23 % EPR 22
% 3.71/6.23 % Horn 50
% 3.71/6.23 % unary 11
% 3.71/6.23 % binary 7
% 3.71/6.23 % lits 175
% 3.71/6.23 % lits eq 34
% 3.71/6.23 % fd_pure 0
% 3.71/6.23 % fd_pseudo 0
% 3.71/6.23 % fd_cond 7
% 3.71/6.23 % fd_pseudo_cond 7
% 3.71/6.23 % AC symbols 0
% 3.71/6.23
% 3.71/6.23 % ------ Schedule dynamic 5 is on
% 3.71/6.23
% 3.71/6.23 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.71/6.23
% 3.71/6.23
% 3.71/6.23 % ------
% 3.71/6.23 % Current options:
% 3.71/6.23 % ------
% 3.71/6.23
% 3.71/6.23
% 3.71/6.23 %
% 3.71/6.23
% 3.71/6.23 % ------ Proving...
% 3.71/6.23 %
% 3.71/6.23
% 3.71/6.23 % SZS status Theorem for theBenchmark.p
% 3.71/6.23
% 3.71/6.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.71/6.23
% 3.71/6.23
%------------------------------------------------------------------------------