%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC308+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 : n004.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:14 PM UTC 2026
% Result : Theorem 6.83s 8.03s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f210ERROR: Could not build tree for root c_16933ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X3
& app(X9,cons(X8,nil)) != X2
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X1)
& ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X1) = X5
& ssList(X6) )
& ssList(X5) )
& X0 = X4
& ssList(X4) )
| ~ neq(X1,nil)
| 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 = X3
& nil != X2 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X3
& app(X9,cons(X8,nil)) != X2
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X1)
& ? [X7] :
( neq(nil,X1)
& hd(X1) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X1) = X5
& ssList(X6) )
& ssList(X5) )
& X0 = X4
& ssList(X4) )
| ~ neq(X1,nil)
| 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)
& ( nil != X3
| nil = X2 )
& ! [X8] :
( ! [X9] :
( app(cons(X8,nil),X9) != X3
| app(X9,cons(X8,nil)) = X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X1)
| ! [X7] :
( ~ neq(nil,X1)
| hd(X1) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X1) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X0 != X4
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X3
| nil = X2 )
& ! [X8] :
( ! [X9] :
( app(cons(X8,nil),X9) != X3
| app(X9,cons(X8,nil)) = X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X1)
| ! [X7] :
( ~ neq(nil,X1)
| hd(X1) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X1) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X0 != X4
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f108,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f122,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(ennf_transformation,[],[f78]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(flattening,[],[f122]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(ennf_transformation,[],[f75]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(flattening,[],[f126]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(ennf_transformation,[],[f76]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(flattening,[],[f133]) ).
fof(f138,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( nil != sK3
| nil = sK2 )
& ! [X8] :
( ! [X9] :
( app(cons(X8,nil),X9) != sK3
| app(X9,cons(X8,nil)) = sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK1)
| ! [X7] :
( ~ neq(nil,sK1)
| hd(sK1) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(sK1) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK0 != X4
| ~ ssList(X4) )
& neq(sK1,nil)
& 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(f143,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f145,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( hd(X0) = sK8(X0)
& ssItem(sK8(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X1,sK8(X0))],[f127]) ).
fof(f146,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( tl(X0) = sK9(X0)
& ssList(sK9(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X1,sK9(X0))],[f134]) ).
fof(f147,plain,
ssList(sK0),
inference(cnf_transformation,[],[f138]) ).
fof(f148,plain,
ssList(sK1),
inference(cnf_transformation,[],[f138]) ).
fof(f152,plain,
! [X8,X9] :
( app(cons(X8,nil),X9) != sK3
| app(X9,cons(X8,nil)) = sK2
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f138]) ).
fof(f154,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f138]) ).
fof(f155,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f156,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f160,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f169,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f180,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f143]) ).
fof(f183,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f185,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f123]) ).
fof(f187,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| hd(X0) = sK8(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f188,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(sK8(X0)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f192,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| tl(X0) = sK9(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f193,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(sK9(X0)) ),
inference(cnf_transformation,[],[f146]) ).
fof(f196,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f154,f156]) ).
fof(f198,plain,
ssList(sK3),
inference(definition_unfolding,[],[f148,f156]) ).
fof(f199,plain,
ssList(sK2),
inference(definition_unfolding,[],[f147,f155]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f196]) ).
tcf(c_50,negated_conjecture,
( ~ ssList(sK2)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ neq(nil,sK3)
| ~ ssList(cons(hd(sK3),nil))
| ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i] :
( ( app(X1,cons(X0,nil)) = sK2 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( app(cons(X0,nil),X1) != sK3 ) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_55,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f198]) ).
tcf(c_56,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f199]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f180]) ).
tcf(c_80,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_83,plain,
ssList(nil),
inference(cnf_transformation,[],[f183]) ).
tcf(c_85,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(hd(X0),tl(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_87,plain,
! [X0: $i] :
( ssItem(sK8(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_88,plain,
! [X0: $i] :
( ( X0 = nil )
| ( hd(X0) = sK8(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f187]) ).
tcf(c_92,plain,
! [X0: $i] :
( ssList(sK9(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_93,plain,
! [X0: $i] :
( ( X0 = nil )
| ( tl(X0) = sK9(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_128,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 )
| ~ ssList(cons(hd(sK3),nil))
| ~ neq(nil,sK3)
| ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3)) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_56,c_50]) ).
tcf(c_129,negated_conjecture,
( ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ neq(nil,sK3)
| ~ ssList(cons(hd(sK3),nil))
| ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 ) ),
inference(renaming,[status(thm)],[c_128]) ).
tcf(c_702,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_80]) ).
tcf(c_703,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_702]) ).
tcf(c_704,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_703,c_55,c_703]) ).
tcf(c_731,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ( X1 != nil )
| ( X0 != sK3 )
| ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_129,c_79]) ).
tcf(c_732,plain,
( ( sK3 = nil )
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 ) ),
inference(unflattening,[status(thm)],[c_731]) ).
tcf(c_733,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 )
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(tl(sK3))
| ~ ssItem(hd(sK3)) ),
inference(global_subsumption_just,[status(thm)],[c_732,c_55,c_83,c_703,c_732]) ).
tcf(c_734,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ( app(tl(sK3),cons(hd(sK3),nil)) != sK2 ) ),
inference(renaming,[status(thm)],[c_733]) ).
tcf(c_2019,plain,
( ( sK3 = nil )
| ( hd(sK3) = sK8(sK3) ) ),
inference(superposition,[status(thm)],[c_55,c_88]) ).
tcf(c_2026,plain,
hd(sK3) = sK8(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_2019,c_704]) ).
tcf(c_2102,plain,
( ( sK3 = nil )
| ( tl(sK3) = sK9(sK3) ) ),
inference(superposition,[status(thm)],[c_55,c_93]) ).
tcf(c_2109,plain,
tl(sK3) = sK9(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_2102,c_704]) ).
tcf(c_2135,plain,
( ssItem(hd(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_2026,c_87]) ).
tcf(c_2136,plain,
ssItem(hd(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_2135,c_704,c_55]) ).
tcf(c_2143,plain,
( ssList(tl(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_2109,c_92]) ).
tcf(c_2144,plain,
ssList(tl(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_2143,c_704,c_55]) ).
tcf(c_2417,plain,
( ( sK3 = nil )
| ( cons(hd(sK3),tl(sK3)) = sK3 ) ),
inference(superposition,[status(thm)],[c_55,c_85]) ).
tcf(c_2425,plain,
cons(hd(sK3),tl(sK3)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_2417,c_704]) ).
tcf(c_2473,plain,
! [X0: $i] :
( ( app(cons(X0,nil),tl(sK3)) = cons(X0,tl(sK3)) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_2144,c_60]) ).
tcf(c_2708,plain,
! [X0: $i] :
( ssList(cons(hd(sK3),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sK3)) ),
inference(instantiation,[status(thm)],[c_69]) ).
tcf(c_2709,plain,
( ssList(cons(hd(sK3),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sK3)) ),
inference(instantiation,[status(thm)],[c_2708]) ).
tcf(c_16541,plain,
app(cons(hd(sK3),nil),tl(sK3)) = cons(hd(sK3),tl(sK3)),
inference(superposition,[status(thm)],[c_2136,c_2473]) ).
tcf(c_16549,plain,
app(cons(hd(sK3),nil),tl(sK3)) = sK3,
inference(light_normalisation,[status(thm)],[c_16541,c_2425]) ).
tcf(c_16909,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_16549,c_51]) ).
tcf(c_16922,plain,
app(tl(sK3),cons(hd(sK3),nil)) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_16909,c_2136,c_2144]) ).
tcf(c_16933,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_16922,c_2709,c_2144,c_2136,c_734,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC308+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.18/5.46 % Computer : n004.cluster.edu
% 0.18/5.46 % Model : x86_64 x86_64
% 0.18/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46 % Memory : 8046.5625MB
% 0.18/5.46 % OS : Linux 6.8.0-71-generic
% 0.18/5.46 % CPULimit : 300
% 0.18/5.46 % WCLimit : 300
% 0.18/5.46 % DateTime : Thu Sep 24 17:32:12 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.24/5.52 Running first-order theorem proving
% 0.24/5.52 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.24/5.54
% 0.24/5.54 % ======== iProver multi-core TPTP/SMT =========
% 0.24/5.54
% 0.24/5.54 % Detected problem language: tptp
% 0.24/5.56 % Proving...
% 6.83/8.03 % SZS status Started for theBenchmark.p
% 6.83/8.03 % SZS status Theorem for theBenchmark.p
% 6.83/8.03
% 6.83/8.03 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.83/8.03
% 6.83/8.03 % ------ iProver source info
% 6.83/8.03
% 6.83/8.03 % git: date: 2026-07-19 20:42:38 +0200
% 6.83/8.03 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.83/8.03 % git: non_committed_changes: false
% 6.83/8.03
% 6.83/8.03 % ------ Parsing...
% 6.83/8.03 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.83/8.03
% 6.83/8.03 % ------ 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 %
% 6.83/8.03
% 6.83/8.03 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.83/8.03
% 6.83/8.03 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.83/8.03 % ------ Proving...
% 6.83/8.03 % ------ Problem Properties
% 6.83/8.03
% 6.83/8.03 %
% 6.83/8.03 % clauses 40
% 6.83/8.03 % conjectures 3
% 6.83/8.03 % EPR 7
% 6.83/8.03 % Horn 27
% 6.83/8.03 % unary 8
% 6.83/8.03 % binary 2
% 6.83/8.03 % lits 124
% 6.83/8.03 % lits eq 50
% 6.83/8.03 % fd_pure 0
% 6.83/8.03 % fd_pseudo 0
% 6.83/8.03 % fd_cond 12
% 6.83/8.03 % fd_pseudo_cond 5
% 6.83/8.03 % AC symbols 0
% 6.83/8.03
% 6.83/8.03 % ------ Schedule dynamic 5 is on
% 6.83/8.03
% 6.83/8.03 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.83/8.03
% 6.83/8.03
% 6.83/8.03 % ------
% 6.83/8.03 % Current options:
% 6.83/8.03 % ------
% 6.83/8.03
% 6.83/8.03
% 6.83/8.03 %
% 6.83/8.03
% 6.83/8.03 % ------ Proving...
% 6.83/8.03 %
% 6.83/8.03
% 6.83/8.03 % SZS status Theorem for theBenchmark.p
% 6.83/8.03
% 6.83/8.03 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.83/8.03
% 6.83/8.03
%------------------------------------------------------------------------------