TSTP Solution File: SWC122+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC122+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:11:18 EDT 2024
% Result : Theorem 12.15s 2.64s
% Output : CNFRefutation 12.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 76 ( 24 unt; 0 def)
% Number of atoms : 379 ( 86 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 466 ( 163 ~; 144 |; 133 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% 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 : 119 ( 0 sgn 63 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
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/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f250,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f249]) ).
fof(f251,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f250,f251]) ).
fof(f253,plain,
! [X0] :
( ! [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) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f254,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK13(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK13(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14])],[f254,f256,f255]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(X1,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = sK55 )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK55)
& neq(sK55,nil) )
| ~ neq(X3,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != X3
| nil = sK55 )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK56
| nil = sK55 )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) )
& ( nil != sK56
| nil = sK55 )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56])],[f222,f346,f345,f344,f343]) ).
fof(f363,plain,
! [X0,X1] :
( ssList(sK12(X0,X1))
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f364,plain,
! [X0,X1] :
( app(sK12(X0,X1),X1) = X0
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f252]) ).
fof(f369,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f257]) ).
fof(f440,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f452,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f533,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f201]) ).
fof(f547,plain,
ssList(sK53),
inference(cnf_transformation,[],[f347]) ).
fof(f548,plain,
ssList(sK54),
inference(cnf_transformation,[],[f347]) ).
fof(f551,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f347]) ).
fof(f552,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f347]) ).
fof(f553,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f347]) ).
fof(f555,plain,
( ~ segmentP(sK54,sK53)
| ~ neq(sK53,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f556,plain,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f557,plain,
( rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f347]) ).
fof(f558,plain,
( ~ segmentP(sK56,sK55)
| ~ neq(sK55,nil) ),
inference(definition_unfolding,[],[f555,f551,f552,f552]) ).
fof(f559,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f553,f551]) ).
fof(f560,plain,
ssList(sK56),
inference(definition_unfolding,[],[f548,f551]) ).
fof(f561,plain,
ssList(sK55),
inference(definition_unfolding,[],[f547,f552]) ).
fof(f567,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f369]) ).
cnf(c_65,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK12(X0,X1),X1) = X0 ),
inference(cnf_transformation,[],[f364]) ).
cnf(c_66,plain,
( ~ rearsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK12(X0,X1)) ),
inference(cnf_transformation,[],[f363]) ).
cnf(c_67,plain,
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f440]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f452]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f533]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| rearsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK55,nil)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_250,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f559]) ).
cnf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f560]) ).
cnf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f561]) ).
cnf(c_369,negated_conjecture,
rearsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_246,c_250,c_246]) ).
cnf(c_371,negated_conjecture,
~ segmentP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_248,c_250,c_247,c_248]) ).
cnf(c_8819,negated_conjecture,
~ segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_371]) ).
cnf(c_8820,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_369]) ).
cnf(c_8821,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8822,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_12021,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_8822,c_232]) ).
cnf(c_16986,plain,
( ~ ssList(sK56)
| ~ ssList(sK55)
| app(sK12(sK56,sK55),sK55) = sK56 ),
inference(superposition,[status(thm)],[c_8820,c_65]) ).
cnf(c_16998,plain,
app(sK12(sK56,sK55),sK55) = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_16986,c_8821,c_8822]) ).
cnf(c_24370,plain,
( ~ ssList(app(app(sK12(sK56,sK55),sK55),X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(superposition,[status(thm)],[c_16998,c_67]) ).
cnf(c_24464,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| ~ ssList(sK55)
| segmentP(app(sK56,X0),sK55) ),
inference(light_normalisation,[status(thm)],[c_24370,c_16998]) ).
cnf(c_24465,plain,
( ~ ssList(app(sK56,X0))
| ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(forward_subsumption_resolution,[status(thm)],[c_24464,c_8821]) ).
cnf(c_33576,plain,
( ~ ssList(X0)
| ~ ssList(sK56)
| ssList(app(sK56,X0)) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_38172,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(X0)
| segmentP(app(sK56,X0),sK55) ),
inference(global_subsumption_just,[status(thm)],[c_24465,c_253,c_24465,c_33576]) ).
cnf(c_38181,plain,
( ~ ssList(sK12(sK56,sK55))
| ~ ssList(nil)
| segmentP(sK56,sK55) ),
inference(superposition,[status(thm)],[c_12021,c_38172]) ).
cnf(c_38185,plain,
~ ssList(sK12(sK56,sK55)),
inference(forward_subsumption_resolution,[status(thm)],[c_38181,c_8819,c_141]) ).
cnf(c_38186,plain,
( ~ rearsegP(sK56,sK55)
| ~ ssList(sK56)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_66,c_38185]) ).
cnf(c_38187,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_38186,c_8821,c_8822,c_8820]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC122+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:33:12 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 12.15/2.64 % SZS status Started for theBenchmark.p
% 12.15/2.64 % SZS status Theorem for theBenchmark.p
% 12.15/2.64
% 12.15/2.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 12.15/2.64
% 12.15/2.64 ------ iProver source info
% 12.15/2.64
% 12.15/2.64 git: date: 2024-05-02 19:28:25 +0000
% 12.15/2.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 12.15/2.64 git: non_committed_changes: false
% 12.15/2.64
% 12.15/2.64 ------ Parsing...
% 12.15/2.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 12.15/2.64
% 12.15/2.64 ------ 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: 5 0s sf_e pe_s pe_e
% 12.15/2.64
% 12.15/2.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.15/2.64
% 12.15/2.64 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 12.15/2.64 ------ Proving...
% 12.15/2.64 ------ Problem Properties
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64 clauses 186
% 12.15/2.64 conjectures 4
% 12.15/2.64 EPR 55
% 12.15/2.64 Horn 118
% 12.15/2.64 unary 22
% 12.15/2.64 binary 40
% 12.15/2.64 lits 624
% 12.15/2.64 lits eq 80
% 12.15/2.64 fd_pure 0
% 12.15/2.64 fd_pseudo 0
% 12.15/2.64 fd_cond 21
% 12.15/2.64 fd_pseudo_cond 14
% 12.15/2.64 AC symbols 0
% 12.15/2.64
% 12.15/2.64 ------ Schedule dynamic 5 is on
% 12.15/2.64
% 12.15/2.64 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64 ------
% 12.15/2.64 Current options:
% 12.15/2.64 ------
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64 ------ Proving...
% 12.15/2.64
% 12.15/2.64
% 12.15/2.64 % SZS status Theorem for theBenchmark.p
% 12.15/2.64
% 12.15/2.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.15/2.64
% 12.15/2.64
%------------------------------------------------------------------------------