%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC106+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 : n013.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:55 PM UTC 2026
% Result : Theorem 3.61s 1.09s
% Output : CNFRefutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 79 ( 20 unt; 1 def)
% Number of atoms : 305 ( 85 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 370 ( 144 ~; 131 |; 71 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 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 : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 164 ( 0 sgn 138 !; 26 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( rearsegP(X1,X0)
& neq(X0,nil) )
| ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| cons(X4,nil) != X2 ) ) )
| ~ 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)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2 ) )
& 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)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2 ) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f107,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) != X0 ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f135,plain,
( ssList(sK3)
& ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK4,sK5,sK6,sK3) )
& sK3 = sK5
& sK4 = sK6 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f131]) ).
fof(f140,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f143,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f129]) ).
fof(f144,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ? [X3] :
( app(X3,X1) = X0
& ssList(X3) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(rectify,[],[f143]) ).
fof(f145,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ( app(sK11(X0,X1),X1) = X0
& ssList(sK11(X0,X1)) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f144]) ).
fof(f152,plain,
ssList(sK3),
inference(cnf_transformation,[],[f135]) ).
fof(f156,plain,
( ~ neq(sK6,nil)
| sP0(sK4,sK5,sK6,sK3) ),
inference(cnf_transformation,[],[f135]) ).
fof(f157,plain,
( neq(sK4,nil)
| sP0(sK4,sK5,sK6,sK3) ),
inference(cnf_transformation,[],[f135]) ).
fof(f158,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f135]) ).
fof(f159,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f135]) ).
fof(f171,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f181,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f117]) ).
fof(f183,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f186,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f196,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f145]) ).
fof(f197,plain,
( neq(sK6,nil)
| sP0(sK6,sK5,sK6,sK5) ),
inference(definition_unfolding,[],[f157,f159,f158,f159]) ).
fof(f198,plain,
( ~ neq(sK6,nil)
| sP0(sK6,sK5,sK6,sK5) ),
inference(definition_unfolding,[],[f156,f159,f158]) ).
fof(f200,plain,
ssList(sK5),
inference(definition_unfolding,[],[f152,f158]) ).
fof(f206,plain,
! [X2,X1] :
( ~ ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X2,X1),X1) ),
inference(equality_resolution,[],[f196]) ).
tcf(c_55,negated_conjecture,
( neq(sK6,nil)
| sP0(sK6,sK5,sK6,sK5) ),
inference(cnf_transformation,[],[f197]) ).
tcf(c_56,negated_conjecture,
( sP0(sK6,sK5,sK6,sK5)
| ~ neq(sK6,nil) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_60,negated_conjecture,
ssList(sK5),
inference(cnf_transformation,[],[f200]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_87,plain,
ssList(nil),
inference(cnf_transformation,[],[f186]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_129,negated_conjecture,
sP0(sK6,sK5,sK6,sK5),
inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_56]) ).
tcf(c_131,negated_conjecture,
sP0(sK6,sK5,sK6,sK5),
inference(global_subsumption_just,[status(thm)],[c_56,c_129]) ).
tcf(c_135,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_82,c_95]) ).
fof(f130,definition,
! [X1,X2,X3,X0] :
( ~ sP0(X1,X2,X3,X0)
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2 ) )
& neq(X1,nil) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f131,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,X2,X3,X0) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(definition_folding,[],[f99,f130]) ).
fof(f132,plain,
! [X1,X2,X3,X0] :
( ~ sP0(X1,X2,X3,X0)
| ( ( ~ rearsegP(X1,X0)
| ~ neq(X0,nil) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X3
& cons(X4,nil) = X2 ) )
& neq(X1,nil) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ( ~ rearsegP(X0,X3)
| ~ neq(X3,nil) )
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X2
& cons(X4,nil) = X1 ) )
& neq(X0,nil) ) ),
inference(rectify,[],[f132]) ).
fof(f134,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ( ~ rearsegP(X0,X3)
| ~ neq(X3,nil) )
& ssItem(sK1(X1,X2))
& ssList(sK2(X1,X2))
& app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2
& cons(sK1(X1,X2),nil) = X1
& neq(X0,nil) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X4,sK1(X1,X2)),skolemize(X5,sK2(X1,X2))],[f133]) ).
fof(f146,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ rearsegP(X0,X3)
| ~ neq(X3,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X1,X2)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f148,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X1,X2)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f149,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f150,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X1,X2),nil) = X1 ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(sK1(X1,X2),nil) = X1 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f149]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X1,X2))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X1,X2))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ neq(X3,nil)
| ~ rearsegP(X0,X3)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_664,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ neq(X3,nil)
| ~ rearsegP(X0,X3)
| ( X3 != sK5 )
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_131]) ).
tcf(c_665,plain,
( ~ rearsegP(sK6,sK5)
| ~ neq(sK5,nil) ),
inference(unflattening,[status(thm)],[c_664]) ).
tcf(c_672,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X1,X2))
| ( X3 != sK5 )
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_131]) ).
tcf(c_673,plain,
ssItem(sK1(sK5,sK6)),
inference(unflattening,[status(thm)],[c_672]) ).
tcf(c_677,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X1,X2))
| ( X3 != sK5 )
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_131]) ).
tcf(c_678,plain,
ssList(sK2(sK5,sK6)),
inference(unflattening,[status(thm)],[c_677]) ).
tcf(c_682,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2 )
| ( X3 != sK5 )
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_131]) ).
tcf(c_683,plain,
app(sK2(sK5,sK6),cons(sK1(sK5,sK6),nil)) = sK6,
inference(unflattening,[status(thm)],[c_682]) ).
tcf(c_687,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(sK1(X1,X2),nil) = X1 )
| ( X3 != sK5 )
| ( X2 != sK6 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_131]) ).
tcf(c_688,plain,
cons(sK1(sK5,sK6),nil) = sK5,
inference(unflattening,[status(thm)],[c_687]) ).
tcf(c_750,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(sK6,sK5)
| ( X1 != nil )
| ( X0 != sK5 ) ),
inference(resolution_lifted,[status(thm)],[c_83,c_665]) ).
tcf(c_751,plain,
( ( sK5 = nil )
| ~ ssList(sK5)
| ~ ssList(nil)
| ~ rearsegP(sK6,sK5) ),
inference(unflattening,[status(thm)],[c_750]) ).
tcf(c_752,plain,
( ( sK5 = nil )
| ~ rearsegP(sK6,sK5) ),
inference(global_subsumption_just,[status(thm)],[c_751,c_60,c_87,c_751]) ).
tcf(c_1057,plain,
app(sK2(sK5,sK6),sK5) = sK6,
inference(light_normalisation,[status(thm)],[c_683,c_688]) ).
tcf(c_1936,plain,
( rearsegP(sK6,sK5)
| ~ ssList(sK5)
| ~ ssList(sK2(sK5,sK6)) ),
inference(superposition,[status(thm)],[c_1057,c_135]) ).
tcf(c_1947,plain,
rearsegP(sK6,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_1936,c_60,c_678]) ).
tcf(c_1950,plain,
nil = sK5,
inference(backward_subsumption_resolution,[status(thm)],[c_752,c_1947]) ).
tcf(c_1957,plain,
cons(sK1(nil,sK6),nil) = nil,
inference(demodulation,[status(thm)],[c_688,c_1950]) ).
tcf(c_1959,plain,
ssItem(sK1(nil,sK6)),
inference(demodulation,[status(thm)],[c_673,c_1950]) ).
tcf(c_2047,plain,
( ~ ssList(nil)
| ~ ssItem(sK1(nil,sK6)) ),
inference(superposition,[status(thm)],[c_1957,c_72]) ).
tcf(c_2049,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2047,c_87,c_1959]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC106+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.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 16:24:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 3.61/1.09 % SZS status Started for theBenchmark.p
% 3.61/1.09 % SZS status Theorem for theBenchmark.p
% 3.61/1.09
% 3.61/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.61/1.09
% 3.61/1.09 % ------ iProver source info
% 3.61/1.09
% 3.61/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 3.61/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.61/1.09 % git: non_committed_changes: false
% 3.61/1.09
% 3.61/1.09 % ------ Parsing...
% 3.61/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.61/1.09
% 3.61/1.09 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 1 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.61/1.09
% 3.61/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.61/1.09
% 3.61/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.61/1.09 % ------ Proving...
% 3.61/1.09 % ------ Problem Properties
% 3.61/1.09
% 3.61/1.09 %
% 3.61/1.09 % clauses 42
% 3.61/1.09 % conjectures 2
% 3.61/1.09 % EPR 15
% 3.61/1.09 % Horn 39
% 3.61/1.09 % unary 13
% 3.61/1.09 % binary 6
% 3.61/1.09 % lits 117
% 3.61/1.09 % lits eq 33
% 3.61/1.09 % fd_pure 0
% 3.61/1.09 % fd_pseudo 0
% 3.61/1.09 % fd_cond 5
% 3.61/1.09 % fd_pseudo_cond 5
% 3.61/1.09 % AC symbols 0
% 3.61/1.09
% 3.61/1.09 % ------ Schedule dynamic 5 is on
% 3.61/1.09
% 3.61/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.61/1.09
% 3.61/1.09
% 3.61/1.09 % ------
% 3.61/1.09 % Current options:
% 3.61/1.09 % ------
% 3.61/1.09
% 3.61/1.09
% 3.61/1.09 %
% 3.61/1.09
% 3.61/1.09 % ------ Proving...
% 3.61/1.09 %
% 3.61/1.09
% 3.61/1.09 % SZS status Theorem for theBenchmark.p
% 3.61/1.09
% 3.61/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.61/1.09
% 3.61/1.09
%------------------------------------------------------------------------------