TSTP Solution File: SWC333+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC333+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n011.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 : Wed Aug 31 18:43:13 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 13 unt; 0 def)
% Number of atoms : 343 ( 28 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 422 ( 125 ~; 131 |; 151 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 61 ( 24 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f698,plain,
$false,
inference(subsumption_resolution,[],[f697,f603]) ).
fof(f603,plain,
~ segmentP(sK47,sK46),
inference(consistent_polarity_flipping,[],[f562]) ).
fof(f562,plain,
segmentP(sK47,sK46),
inference(definition_unfolding,[],[f517,f514,f513]) ).
fof(f513,plain,
sK48 = sK46,
inference(cnf_transformation,[],[f327]) ).
fof(f327,plain,
( ssList(sK47)
& segmentP(sK49,sK48)
& ! [X4] :
( ~ segmentP(sK49,X4)
| ~ ssList(X4)
| ~ neq(sK48,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK48) )
& ssList(sK49)
& sK49 = sK47
& sK48 = sK46
& ( ( ssList(sK50)
& segmentP(sK47,sK50)
& totalorderedP(sK50)
& segmentP(sK50,sK46)
& neq(sK46,sK50) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(sK48)
& ssList(sK48)
& ssList(sK46) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK46,sK47,sK48,sK49,sK50])],[f105,f326,f325,f324,f323,f322]) ).
fof(f322,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& X1 = X3
& X0 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& segmentP(X5,X0)
& neq(X0,X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& totalorderedP(X2) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& X1 = X3
& sK46 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(X1,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(X2) )
& ssList(X2) ) )
& ssList(sK46) ) ),
introduced(choice_axiom,[]) ).
fof(f323,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& X1 = X3
& sK46 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(X1,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(X2) )
& ssList(X2) ) )
=> ( ssList(sK47)
& ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& sK47 = X3
& sK46 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(X2) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f324,plain,
( ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& sK47 = X3
& sK46 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(X2) )
& ssList(X2) )
=> ( ? [X3] :
( segmentP(X3,sK48)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(sK48,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK48) )
& ssList(X3)
& sK47 = X3
& sK48 = sK46
& ( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(sK48) )
& ssList(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f325,plain,
( ? [X3] :
( segmentP(X3,sK48)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(sK48,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK48) )
& ssList(X3)
& sK47 = X3
& sK48 = sK46
& ( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(sK48) )
=> ( segmentP(sK49,sK48)
& ! [X4] :
( ~ segmentP(sK49,X4)
| ~ ssList(X4)
| ~ neq(sK48,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK48) )
& ssList(sK49)
& sK49 = sK47
& sK48 = sK46
& ( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) )
& totalorderedP(sK48) ) ),
introduced(choice_axiom,[]) ).
fof(f326,plain,
( ? [X5] :
( ssList(X5)
& segmentP(sK47,X5)
& totalorderedP(X5)
& segmentP(X5,sK46)
& neq(sK46,X5) )
=> ( ssList(sK50)
& segmentP(sK47,sK50)
& totalorderedP(sK50)
& segmentP(sK50,sK46)
& neq(sK46,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ssList(X3)
& X1 = X3
& X0 = X2
& ( ? [X5] :
( ssList(X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& segmentP(X5,X0)
& neq(X0,X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& totalorderedP(X2) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( totalorderedP(X2)
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,X2) )
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& segmentP(X1,X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& segmentP(X3,X2)
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ totalorderedP(X2)
| ? [X4] :
( segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4)
& ssList(X4)
& neq(X2,X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5)
| ~ segmentP(X1,X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) )
| ~ segmentP(X3,X2)
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ totalorderedP(X2)
| ? [X4] :
( segmentP(X3,X4)
& segmentP(X4,X2)
& totalorderedP(X4)
& ssList(X4)
& neq(X2,X4) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5)
| ~ segmentP(X1,X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) )
| ~ segmentP(X3,X2)
| X1 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f514,plain,
sK49 = sK47,
inference(cnf_transformation,[],[f327]) ).
fof(f517,plain,
segmentP(sK49,sK48),
inference(cnf_transformation,[],[f327]) ).
fof(f697,plain,
segmentP(sK47,sK46),
inference(subsumption_resolution,[],[f696,f648]) ).
fof(f648,plain,
~ totalorderedP(sK46),
inference(consistent_polarity_flipping,[],[f565]) ).
fof(f565,plain,
totalorderedP(sK46),
inference(definition_unfolding,[],[f507,f513]) ).
fof(f507,plain,
totalorderedP(sK48),
inference(cnf_transformation,[],[f327]) ).
fof(f696,plain,
( totalorderedP(sK46)
| segmentP(sK47,sK46) ),
inference(resolution,[],[f695,f611]) ).
fof(f611,plain,
( ~ segmentP(sK47,sK50)
| totalorderedP(sK46)
| segmentP(sK47,sK46) ),
inference(consistent_polarity_flipping,[],[f511]) ).
fof(f511,plain,
( ~ totalorderedP(sK46)
| segmentP(sK47,sK50)
| ~ segmentP(sK47,sK46) ),
inference(cnf_transformation,[],[f327]) ).
fof(f695,plain,
segmentP(sK47,sK50),
inference(subsumption_resolution,[],[f694,f648]) ).
fof(f694,plain,
( segmentP(sK47,sK50)
| totalorderedP(sK46) ),
inference(subsumption_resolution,[],[f693,f603]) ).
fof(f693,plain,
( segmentP(sK47,sK46)
| totalorderedP(sK46)
| segmentP(sK47,sK50) ),
inference(resolution,[],[f692,f610]) ).
fof(f610,plain,
( ~ segmentP(sK50,sK46)
| totalorderedP(sK46)
| segmentP(sK47,sK46) ),
inference(consistent_polarity_flipping,[],[f509]) ).
fof(f509,plain,
( segmentP(sK50,sK46)
| ~ totalorderedP(sK46)
| ~ segmentP(sK47,sK46) ),
inference(cnf_transformation,[],[f327]) ).
fof(f692,plain,
( segmentP(sK50,sK46)
| segmentP(sK47,sK50) ),
inference(subsumption_resolution,[],[f691,f685]) ).
fof(f685,plain,
~ totalorderedP(sK50),
inference(subsumption_resolution,[],[f684,f648]) ).
fof(f684,plain,
( ~ totalorderedP(sK50)
| totalorderedP(sK46) ),
inference(subsumption_resolution,[],[f671,f603]) ).
fof(f671,plain,
( segmentP(sK47,sK46)
| ~ totalorderedP(sK50)
| totalorderedP(sK46) ),
inference(consistent_polarity_flipping,[],[f510]) ).
fof(f510,plain,
( totalorderedP(sK50)
| ~ segmentP(sK47,sK46)
| ~ totalorderedP(sK46) ),
inference(cnf_transformation,[],[f327]) ).
fof(f691,plain,
( segmentP(sK50,sK46)
| totalorderedP(sK50)
| segmentP(sK47,sK50) ),
inference(subsumption_resolution,[],[f690,f603]) ).
fof(f690,plain,
( segmentP(sK47,sK46)
| segmentP(sK47,sK50)
| totalorderedP(sK50)
| segmentP(sK50,sK46) ),
inference(subsumption_resolution,[],[f689,f688]) ).
fof(f688,plain,
ssList(sK50),
inference(subsumption_resolution,[],[f687,f648]) ).
fof(f687,plain,
( ssList(sK50)
| totalorderedP(sK46) ),
inference(resolution,[],[f649,f603]) ).
fof(f649,plain,
( segmentP(sK47,sK46)
| ssList(sK50)
| totalorderedP(sK46) ),
inference(consistent_polarity_flipping,[],[f512]) ).
fof(f512,plain,
( ~ totalorderedP(sK46)
| ~ segmentP(sK47,sK46)
| ssList(sK50) ),
inference(cnf_transformation,[],[f327]) ).
fof(f689,plain,
( ~ ssList(sK50)
| segmentP(sK47,sK50)
| totalorderedP(sK50)
| segmentP(sK50,sK46)
| segmentP(sK47,sK46) ),
inference(resolution,[],[f619,f683]) ).
fof(f683,plain,
( ~ neq(sK46,sK50)
| segmentP(sK47,sK46) ),
inference(subsumption_resolution,[],[f612,f648]) ).
fof(f612,plain,
( totalorderedP(sK46)
| ~ neq(sK46,sK50)
| segmentP(sK47,sK46) ),
inference(consistent_polarity_flipping,[],[f508]) ).
fof(f508,plain,
( ~ segmentP(sK47,sK46)
| neq(sK46,sK50)
| ~ totalorderedP(sK46) ),
inference(cnf_transformation,[],[f327]) ).
fof(f619,plain,
! [X4] :
( neq(sK46,X4)
| ~ ssList(X4)
| segmentP(sK47,X4)
| totalorderedP(X4)
| segmentP(X4,sK46) ),
inference(consistent_polarity_flipping,[],[f563]) ).
fof(f563,plain,
! [X4] :
( ~ ssList(X4)
| ~ totalorderedP(X4)
| ~ neq(sK46,X4)
| ~ segmentP(sK47,X4)
| ~ segmentP(X4,sK46) ),
inference(definition_unfolding,[],[f516,f514,f513,f513]) ).
fof(f516,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ ssList(X4)
| ~ neq(sK48,X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK48) ),
inference(cnf_transformation,[],[f327]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC333+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:45:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.47 % (15333)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.48 % (15349)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.49 % (15357)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.51 % (15349)First to succeed.
% 0.19/0.51 % (15349)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (15349)------------------------------
% 0.19/0.51 % (15349)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (15349)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (15349)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (15349)Memory used [KB]: 1407
% 0.19/0.51 % (15349)Time elapsed: 0.124 s
% 0.19/0.51 % (15349)Instructions burned: 17 (million)
% 0.19/0.51 % (15349)------------------------------
% 0.19/0.51 % (15349)------------------------------
% 0.19/0.51 % (15329)Success in time 0.158 s
%------------------------------------------------------------------------------