TSTP Solution File: SWC269+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC269+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n018.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 : Tue Apr 30 16:15:24 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 175 ( 27 equ)
% Maximal formula atoms : 28 ( 12 avg)
% Number of connectives : 237 ( 76 ~; 54 |; 95 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 ( 19 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f731,plain,
$false,
inference(subsumption_resolution,[],[f730,f446]) ).
fof(f446,plain,
~ totalorderedP(sK41),
inference(cnf_transformation,[],[f288]) ).
fof(f288,plain,
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK43)
| ~ frontsegP(sK44,X4)
| ~ neq(sK43,X4)
| ~ ssList(X4) )
& totalorderedP(sK43)
& frontsegP(sK44,sK43)
& sK41 = sK43
& sK42 = sK44
& ssList(sK44)
& ssList(sK43)
& ssList(sK42)
& ssList(sK41) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK41,sK42,sK43,sK44])],[f99,f287,f286,f285,f284]) ).
fof(f284,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK41 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK41) ) ),
introduced(choice_axiom,[]) ).
fof(f285,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK41 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK41 = X2
& sK42 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK42) ) ),
introduced(choice_axiom,[]) ).
fof(f286,plain,
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK41 = X2
& sK42 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK43)
| ~ frontsegP(X3,X4)
| ~ neq(sK43,X4)
| ~ ssList(X4) )
& totalorderedP(sK43)
& frontsegP(X3,sK43)
& sK41 = sK43
& sK42 = X3
& ssList(X3) )
& ssList(sK43) ) ),
introduced(choice_axiom,[]) ).
fof(f287,plain,
( ? [X3] :
( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK43)
| ~ frontsegP(X3,X4)
| ~ neq(sK43,X4)
| ~ ssList(X4) )
& totalorderedP(sK43)
& frontsegP(X3,sK43)
& sK41 = sK43
& sK42 = X3
& ssList(X3) )
=> ( ~ totalorderedP(sK41)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK43)
| ~ frontsegP(sK44,X4)
| ~ neq(sK43,X4)
| ~ ssList(X4) )
& totalorderedP(sK43)
& frontsegP(sK44,sK43)
& sK41 = sK43
& sK42 = sK44
& ssList(sK44) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& X1 = X3
& 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(X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( totalorderedP(X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f730,plain,
totalorderedP(sK41),
inference(forward_demodulation,[],[f444,f442]) ).
fof(f442,plain,
sK41 = sK43,
inference(cnf_transformation,[],[f288]) ).
fof(f444,plain,
totalorderedP(sK43),
inference(cnf_transformation,[],[f288]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC269+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 04:23:13 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (18243)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.39 % (18244)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 % (18250)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.39 % (18249)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.39 % (18246)WARNING: value z3 for option sas not known
% 0.14/0.40 % (18246)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.40 % (18247)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.40 % (18248)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.40 % (18250)First to succeed.
% 0.14/0.40 % (18245)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.40 % (18250)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (18250)------------------------------
% 0.14/0.40 % (18250)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.40 % (18250)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (18250)Memory used [KB]: 1296
% 0.14/0.40 % (18250)Time elapsed: 0.011 s
% 0.14/0.40 % (18250)Instructions burned: 18 (million)
% 0.14/0.40 % (18250)------------------------------
% 0.14/0.40 % (18250)------------------------------
% 0.14/0.40 % (18243)Success in time 0.017 s
%------------------------------------------------------------------------------