%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC030+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 : n015.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:35 PM UTC 2026
% Result : Theorem 3.81s 1.18s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f548ERROR: Could not build tree for root c_17666ERROR: MakeTreeStats fails)
% 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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
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)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| 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)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f132,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f158,plain,
! [X0] :
( ~ ssList(X0)
| ( frontsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X5,X4) = X2
& app(X4,X5) = X3 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X5,X4) = X2
& app(X4,X5) = X3 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f240,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,[],[f101]) ).
fof(f241,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,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
fof(f283,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ frontsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| frontsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f158]) ).
fof(f292,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f200]) ).
fof(f293,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(flattening,[],[f292]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( nil != sK54
& nil = sK53 )
| ( nil != sK53
& nil = sK54 ) )
& ssList(sK57)
& ssList(sK58)
& sK55 = app(sK58,sK57)
& sK56 = app(sK57,sK58)
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58)],[f222]) ).
fof(f311,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f242]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f429,plain,
! [X0] :
( ~ ssList(X0)
| ~ frontsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f283]) ).
fof(f480,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1)
| nil = X1 ),
inference(cnf_transformation,[],[f293]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f500,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK53
| nil = sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
ssList(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
ssList(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK55 = app(sK58,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK56 = app(sK57,sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
( nil = sK55
| nil = sK56 ),
inference(definition_unfolding,[],[f503,f509,f508]) ).
fof(f513,plain,
( nil != sK56
| nil != sK55 ),
inference(definition_unfolding,[],[f500,f508,f509]) ).
fof(f519,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f311]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f519]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f401]) ).
tcf(c_155,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f403]) ).
tcf(c_182,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f429]) ).
tcf(c_229,plain,
( ( app(nil,nil) = nil )
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f548]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i] :
( ( X1 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f480]) ).
tcf(c_232,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f482]) ).
tcf(c_246,negated_conjecture,
app(sK57,sK58) = sK56,
inference(cnf_transformation,[],[f507]) ).
tcf(c_247,negated_conjecture,
app(sK58,sK57) = sK55,
inference(cnf_transformation,[],[f506]) ).
tcf(c_248,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f505]) ).
tcf(c_249,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f504]) ).
tcf(c_250,negated_conjecture,
( ( nil = sK55 )
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_251,negated_conjecture,
( ( nil != sK55 )
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f513]) ).
tcf(c_296,plain,
( ( app(nil,nil) = nil )
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_368,plain,
app(nil,nil) = nil,
inference(global_subsumption_just,[status(thm)],[c_229,c_141,c_296]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
tcf(c_9690,definition,
iPr_def_10 = app(sK58,sK57),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_9691,definition,
iPr_def_11 = app(sK57,sK58),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_9694,negated_conjecture,
( ( nil != sK55 )
| ( nil != sK56 ) ),
inference(demodulation,[status(thm)],[c_251]) ).
tcf(c_9695,negated_conjecture,
( ( nil = sK55 )
| ( nil = sK56 ) ),
inference(demodulation,[status(thm)],[c_250]) ).
tcf(c_9696,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_249]) ).
tcf(c_9697,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_248]) ).
tcf(c_9698,negated_conjecture,
iPr_def_10 = sK55,
inference(demodulation,[status(thm)],[c_247,c_9690]) ).
tcf(c_9699,negated_conjecture,
iPr_def_11 = sK56,
inference(demodulation,[status(thm)],[c_246,c_9691]) ).
tcf(c_13412,plain,
( ( nil = iPr_def_11 )
| ( nil = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_9695,c_9698,c_9699]) ).
tcf(c_13415,plain,
( ( nil != iPr_def_11 )
| ( nil != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_9694,c_9698,c_9699]) ).
tcf(c_13422,plain,
( ( nil = iPr_def_10 )
| ( iPr_def_10 != iPr_def_11 )
| ( nil != iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_13412,c_13415]) ).
tcf(c_13473,plain,
( ( nil = iPr_def_10 )
| ( iPr_def_10 != iPr_def_11 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13422,c_13412]) ).
tcf(c_13943,plain,
app(nil,sK58) = sK58,
inference(superposition,[status(thm)],[c_9697,c_155]) ).
tcf(c_14033,plain,
app(sK58,nil) = sK58,
inference(superposition,[status(thm)],[c_9697,c_232]) ).
tcf(c_15031,plain,
! [X0: $i] :
( ( nil = iPr_def_10 )
| ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(iPr_def_11,X0) ),
inference(superposition,[status(thm)],[c_13412,c_182]) ).
tcf(c_15292,plain,
( frontsegP(iPr_def_11,sK57)
| ~ ssList(sK58)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_9691,c_377]) ).
tcf(c_15335,plain,
frontsegP(iPr_def_11,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_15292,c_9697,c_9696]) ).
tcf(c_15801,plain,
( ( nil = iPr_def_10 )
| ( nil = sK57 )
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_15335,c_15031]) ).
tcf(c_15802,plain,
( ( nil = iPr_def_10 )
| ( nil = sK57 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_15801,c_9696]) ).
tcf(c_15825,plain,
( ( nil = iPr_def_10 )
| ( app(nil,sK58) = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_15802,c_9691]) ).
tcf(c_15826,plain,
( ( nil = iPr_def_10 )
| ( app(sK58,nil) = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_15802,c_9690]) ).
tcf(c_15832,plain,
( ( sK58 = iPr_def_10 )
| ( nil = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_15826,c_14033]) ).
tcf(c_15835,plain,
( ( sK58 = iPr_def_11 )
| ( nil = iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_15825,c_13943]) ).
tcf(c_16145,plain,
( ( iPr_def_10 = iPr_def_11 )
| ( nil = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_15832,c_15835]) ).
tcf(c_16204,plain,
nil = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_16145,c_13473]) ).
tcf(c_16260,plain,
app(sK58,iPr_def_10) = sK58,
inference(demodulation,[status(thm)],[c_14033,c_16204]) ).
tcf(c_16300,plain,
app(iPr_def_10,iPr_def_10) = iPr_def_10,
inference(demodulation,[status(thm)],[c_368,c_16204]) ).
tcf(c_16301,plain,
( ( iPr_def_10 != iPr_def_11 )
| ( iPr_def_10 != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_13415,c_16204]) ).
tcf(c_16324,plain,
iPr_def_10 != iPr_def_11,
inference(equality_resolution_simp,[status(thm)],[c_16301]) ).
tcf(c_17611,plain,
! [X0: $i,X1: $i] :
( ( X1 = iPr_def_10 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_230,c_16204]) ).
tcf(c_17625,plain,
( ( sK57 = iPr_def_10 )
| ~ ssList(sK58)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_9690,c_17611]) ).
tcf(c_17634,plain,
sK57 = iPr_def_10,
inference(forward_subsumption_resolution,[status(thm)],[c_17625,c_9697,c_9696]) ).
tcf(c_17644,plain,
app(iPr_def_10,sK58) = iPr_def_11,
inference(demodulation,[status(thm)],[c_9691,c_17634]) ).
tcf(c_17645,plain,
app(sK58,iPr_def_10) = iPr_def_10,
inference(demodulation,[status(thm)],[c_9690,c_17634]) ).
tcf(c_17647,plain,
sK58 = iPr_def_10,
inference(demodulation,[status(thm)],[c_16260,c_17645]) ).
tcf(c_17665,plain,
iPr_def_10 = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_17644,c_16300,c_17647]) ).
tcf(c_17666,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_17665,c_16324]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC030+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.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 16:03:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.81/1.18 % SZS status Started for theBenchmark.p
% 3.81/1.18 % SZS status Theorem for theBenchmark.p
% 3.81/1.18
% 3.81/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.81/1.18
% 3.81/1.18 % ------ iProver source info
% 3.81/1.18
% 3.81/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.81/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.81/1.18 % git: non_committed_changes: false
% 3.81/1.18
% 3.81/1.18 % ------ Parsing...
% 3.81/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.81/1.18
% 3.81/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.81/1.18
% 3.81/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.81/1.18
% 3.81/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.81/1.18 % ------ Proving...
% 3.81/1.18 % ------ Problem Properties
% 3.81/1.18
% 3.81/1.18 %
% 3.81/1.18 % clauses 190
% 3.81/1.18 % conjectures 8
% 3.81/1.18 % EPR 57
% 3.81/1.18 % Horn 121
% 3.81/1.18 % unary 24
% 3.81/1.18 % binary 42
% 3.81/1.18 % lits 630
% 3.81/1.18 % lits eq 86
% 3.81/1.18 % fd_pure 0
% 3.81/1.18 % fd_pseudo 0
% 3.81/1.18 % fd_cond 21
% 3.81/1.18 % fd_pseudo_cond 14
% 3.81/1.18 % AC symbols 0
% 3.81/1.18
% 3.81/1.18 % ------ Schedule dynamic 5 is on
% 3.81/1.18
% 3.81/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.81/1.18
% 3.81/1.18
% 3.81/1.18 % ------
% 3.81/1.18 % Current options:
% 3.81/1.18 % ------
% 3.81/1.18
% 3.81/1.18
% 3.81/1.18 %
% 3.81/1.18
% 3.81/1.18 % ------ Proving...
% 3.81/1.18 %
% 3.81/1.18
% 3.81/1.18 % SZS status Theorem for theBenchmark.p
% 3.81/1.18
% 3.81/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.18
% 3.81/1.18
%------------------------------------------------------------------------------