TSTP Solution File: SWC332+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC332+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 : n013.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:25:04 EDT 2024
% Result : Theorem 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 12
% Syntax : Number of formulae : 67 ( 17 unt; 0 def)
% Number of atoms : 286 ( 71 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 335 ( 116 ~; 103 |; 92 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 63 ( 34 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1152,plain,
$false,
inference(resolution,[],[f1150,f1122]) ).
fof(f1122,plain,
segmentP(nil,nil),
inference(backward_demodulation,[],[f1066,f1099]) ).
fof(f1099,plain,
nil = sK18,
inference(resolution,[],[f1096,f637]) ).
fof(f637,plain,
ssList(sK18),
inference(forward_demodulation,[],[f376,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(sK21,nil)
| singletonP(sK20) )
& segmentP(sK21,sK20)
& 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] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(X1,sK18) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(X1,sK18) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(X3,nil)
| singletonP(sK20) )
& segmentP(X3,sK20)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(X3,nil)
| singletonP(sK20) )
& segmentP(X3,sK20)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) )
& ( ~ neq(sK21,nil)
| singletonP(sK20) )
& segmentP(sK21,sK20)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(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)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(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)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f1096,plain,
( ~ ssList(sK18)
| nil = sK18 ),
inference(resolution,[],[f1066,f551]) ).
fof(f551,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f349]) ).
fof(f349,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f1066,plain,
segmentP(nil,sK18),
inference(backward_demodulation,[],[f636,f1061]) ).
fof(f1061,plain,
nil = sK21,
inference(resolution,[],[f1060,f391]) ).
fof(f391,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1060,plain,
( ~ ssList(nil)
| nil = sK21 ),
inference(resolution,[],[f1059,f637]) ).
fof(f1059,plain,
( ~ ssList(sK18)
| ~ ssList(nil)
| nil = sK21 ),
inference(resolution,[],[f1050,f377]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f1050,plain,
( ~ ssList(sK21)
| nil = sK21
| ~ ssList(nil)
| ~ ssList(sK18) ),
inference(duplicate_literal_removal,[],[f1047]) ).
fof(f1047,plain,
( ~ ssList(sK18)
| nil = sK21
| nil = sK21
| ~ ssList(nil)
| ~ ssList(sK21) ),
inference(resolution,[],[f1046,f571]) ).
fof(f571,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/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1046,plain,
( ~ neq(sK21,nil)
| ~ ssList(sK18)
| nil = sK21 ),
inference(resolution,[],[f1045,f635]) ).
fof(f635,plain,
( singletonP(sK18)
| ~ neq(sK21,nil) ),
inference(forward_demodulation,[],[f381,f379]) ).
fof(f381,plain,
( ~ neq(sK21,nil)
| singletonP(sK20) ),
inference(cnf_transformation,[],[f254]) ).
fof(f1045,plain,
( ~ singletonP(sK18)
| nil = sK21
| ~ ssList(sK18) ),
inference(resolution,[],[f1044,f465]) ).
fof(f465,plain,
! [X0] :
( ssItem(sK26(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f284,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK26(X0),nil) = X0
& ssItem(sK26(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK26])],[f282,f283]) ).
fof(f283,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK26(X0),nil) = X0
& ssItem(sK26(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f281]) ).
fof(f281,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f1044,plain,
( ~ ssItem(sK26(sK18))
| nil = sK21 ),
inference(resolution,[],[f1043,f636]) ).
fof(f1043,plain,
( ~ segmentP(sK21,sK18)
| nil = sK21
| ~ ssItem(sK26(sK18)) ),
inference(resolution,[],[f1025,f634]) ).
fof(f634,plain,
( ~ equalelemsP(sK18)
| ~ segmentP(sK21,sK18) ),
inference(forward_demodulation,[],[f382,f378]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f382,plain,
( ~ equalelemsP(sK18)
| ~ segmentP(sK19,sK18) ),
inference(cnf_transformation,[],[f254]) ).
fof(f1025,plain,
( equalelemsP(sK18)
| ~ ssItem(sK26(sK18))
| nil = sK21 ),
inference(superposition,[],[f402,f1018]) ).
fof(f1018,plain,
( sK18 = cons(sK26(sK18),nil)
| nil = sK21 ),
inference(resolution,[],[f1017,f391]) ).
fof(f1017,plain,
( ~ ssList(nil)
| nil = sK21
| sK18 = cons(sK26(sK18),nil) ),
inference(resolution,[],[f1016,f637]) ).
fof(f1016,plain,
( ~ ssList(sK18)
| nil = sK21
| ~ ssList(nil)
| sK18 = cons(sK26(sK18),nil) ),
inference(resolution,[],[f970,f377]) ).
fof(f970,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = sK21
| ~ ssList(sK18)
| sK18 = cons(sK26(sK18),nil) ),
inference(resolution,[],[f571,f823]) ).
fof(f823,plain,
( ~ neq(sK21,nil)
| ~ ssList(sK18)
| sK18 = cons(sK26(sK18),nil) ),
inference(resolution,[],[f466,f635]) ).
fof(f466,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK26(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
fof(f402,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,axiom,
! [X0] :
( ssItem(X0)
=> equalelemsP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).
fof(f636,plain,
segmentP(sK21,sK18),
inference(forward_demodulation,[],[f380,f379]) ).
fof(f380,plain,
segmentP(sK21,sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f1150,plain,
~ segmentP(nil,nil),
inference(resolution,[],[f1138,f390]) ).
fof(f390,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).
fof(f1138,plain,
( ~ equalelemsP(nil)
| ~ segmentP(nil,nil) ),
inference(forward_demodulation,[],[f1120,f1099]) ).
fof(f1120,plain,
( ~ equalelemsP(nil)
| ~ segmentP(nil,sK18) ),
inference(backward_demodulation,[],[f1064,f1099]) ).
fof(f1064,plain,
( ~ equalelemsP(sK18)
| ~ segmentP(nil,sK18) ),
inference(backward_demodulation,[],[f634,f1061]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC332+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n013.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 : Fri May 3 20:31:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (17642)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (17647)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.13/0.36 % (17645)WARNING: value z3 for option sas not known
% 0.13/0.36 % (17644)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.36 % (17643)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.36 % (17646)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.36 % (17645)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.13/0.36 % (17648)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.13/0.36 % (17649)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.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [2]
% 0.13/0.38 TRYING [2]
% 0.20/0.39 % (17648)First to succeed.
% 0.20/0.39 TRYING [3]
% 0.20/0.39 % (17648)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17642"
% 0.20/0.39 TRYING [3]
% 0.20/0.39 % (17645)Also succeeded, but the first one will report.
% 0.20/0.40 % (17648)Refutation found. Thanks to Tanya!
% 0.20/0.40 % SZS status Theorem for theBenchmark
% 0.20/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.40 % (17648)------------------------------
% 0.20/0.40 % (17648)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.40 % (17648)Termination reason: Refutation
% 0.20/0.40
% 0.20/0.40 % (17648)Memory used [KB]: 1660
% 0.20/0.40 % (17648)Time elapsed: 0.032 s
% 0.20/0.40 % (17648)Instructions burned: 55 (million)
% 0.20/0.40 % (17642)Success in time 0.041 s
%------------------------------------------------------------------------------