TSTP Solution File: SWC127+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC127+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 : n023.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 : Sun May 5 10:00:35 EDT 2024
% Result : Theorem 0.22s 0.41s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 15 unt; 0 def)
% Number of atoms : 196 ( 37 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 229 ( 69 ~; 52 |; 92 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 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 : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f970,plain,
$false,
inference(resolution,[],[f968,f380]) ).
fof(f380,plain,
neq(sK19,nil),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(sK21,nil)
| singletonP(sK20) )
& segmentP(sK21,sK20)
& 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(X1,X0)
| ~ neq(X0,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& 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(X1,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(sK20) )
& segmentP(X3,sK20)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(X3,nil)
| singletonP(sK20) )
& segmentP(X3,sK20)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ segmentP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( ~ neq(sK21,nil)
| singletonP(sK20) )
& segmentP(sK21,sK20)
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& 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(X1,X0)
| ~ neq(X0,nil) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& 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(X1,X0)
& neq(X0,nil) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ 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(X1,X0)
& neq(X0,nil) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f968,plain,
~ neq(sK19,nil),
inference(resolution,[],[f940,f384]) ).
fof(f384,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f940,plain,
( singletonP(nil)
| ~ neq(sK19,nil) ),
inference(backward_demodulation,[],[f636,f937]) ).
fof(f937,plain,
nil = sK18,
inference(resolution,[],[f936,f392]) ).
fof(f392,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f936,plain,
( ~ ssList(nil)
| nil = sK18 ),
inference(resolution,[],[f935,f640]) ).
fof(f640,plain,
ssList(sK18),
inference(forward_demodulation,[],[f376,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f935,plain,
( ~ ssList(sK18)
| ~ ssList(nil)
| nil = sK18 ),
inference(resolution,[],[f928,f638]) ).
fof(f638,plain,
segmentP(sK19,sK18),
inference(forward_demodulation,[],[f637,f378]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f637,plain,
segmentP(sK21,sK18),
inference(forward_demodulation,[],[f381,f379]) ).
fof(f381,plain,
segmentP(sK21,sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f928,plain,
( ~ segmentP(sK19,sK18)
| ~ ssList(nil)
| ~ ssList(sK18)
| nil = sK18 ),
inference(resolution,[],[f572,f383]) ).
fof(f383,plain,
( ~ neq(sK18,nil)
| ~ segmentP(sK19,sK18) ),
inference(cnf_transformation,[],[f254]) ).
fof(f572,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f355]) ).
fof(f355,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f636,plain,
( singletonP(sK18)
| ~ neq(sK19,nil) ),
inference(forward_demodulation,[],[f635,f379]) ).
fof(f635,plain,
( ~ neq(sK19,nil)
| singletonP(sK20) ),
inference(forward_demodulation,[],[f382,f378]) ).
fof(f382,plain,
( ~ neq(sK21,nil)
| singletonP(sK20) ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC127+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:32:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (4204)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (4207)WARNING: value z3 for option sas not known
% 0.15/0.38 % (4205)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (4206)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (4208)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (4207)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.38 % (4209)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.38 % (4210)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.38 % (4211)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.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [1]
% 0.22/0.40 TRYING [2]
% 0.22/0.40 TRYING [2]
% 0.22/0.41 % (4210)First to succeed.
% 0.22/0.41 % (4210)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4204"
% 0.22/0.41 % (4210)Refutation found. Thanks to Tanya!
% 0.22/0.41 % SZS status Theorem for theBenchmark
% 0.22/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.41 % (4210)------------------------------
% 0.22/0.41 % (4210)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.41 % (4210)Termination reason: Refutation
% 0.22/0.41
% 0.22/0.41 % (4210)Memory used [KB]: 1522
% 0.22/0.41 % (4210)Time elapsed: 0.024 s
% 0.22/0.41 % (4210)Instructions burned: 40 (million)
% 0.22/0.41 % (4204)Success in time 0.044 s
%------------------------------------------------------------------------------