TSTP Solution File: SWC209+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC209+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 May 21 05:03:03 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 159 ( 58 equ)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 166 ( 29 ~; 25 |; 100 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f650,plain,
$false,
inference(resolution,[],[f649,f645]) ).
fof(f645,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f638,f641]) ).
fof(f641,plain,
nil = sK21,
inference(resolution,[],[f382,f637]) ).
fof(f637,plain,
~ neq(sK20,nil),
inference(forward_demodulation,[],[f381,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ( segmentP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( segmentP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( segmentP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( segmentP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ~ neq(sK18,nil)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f381,plain,
~ neq(sK18,nil),
inference(cnf_transformation,[],[f254]) ).
fof(f382,plain,
( neq(sK20,nil)
| nil = sK21 ),
inference(cnf_transformation,[],[f254]) ).
fof(f638,plain,
neq(sK21,nil),
inference(forward_demodulation,[],[f380,f378]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f380,plain,
neq(sK19,nil),
inference(cnf_transformation,[],[f254]) ).
fof(f649,plain,
~ neq(nil,nil),
inference(backward_demodulation,[],[f637,f646]) ).
fof(f646,plain,
nil = sK20,
inference(resolution,[],[f383,f637]) ).
fof(f383,plain,
( neq(sK20,nil)
| nil = sK20 ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC209+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.33 % Computer : n019.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Sun May 19 03:04:08 EDT 2024
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % (32588)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.35 % (32595)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.36 % (32596)WARNING: value z3 for option sas not known
% 0.15/0.36 % (32594)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.36 % (32599)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.15/0.36 % (32600)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.15/0.36 % (32598)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.15/0.36 % (32596)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.15/0.36 % (32597)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.36 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.37 % (32599)First to succeed.
% 0.15/0.37 % (32598)Also succeeded, but the first one will report.
% 0.15/0.37 % (32599)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32588"
% 0.15/0.37 % (32599)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.37 % (32599)------------------------------
% 0.15/0.37 % (32599)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.37 % (32599)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (32599)Memory used [KB]: 1236
% 0.15/0.37 % (32599)Time elapsed: 0.013 s
% 0.15/0.37 % (32599)Instructions burned: 19 (million)
% 0.15/0.37 % (32588)Success in time 0.028 s
%------------------------------------------------------------------------------