TSTP Solution File: SWC121+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC121+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 : n024.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 15:54:45 EDT 2024
% Result : Theorem 0.12s 0.38s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 185 ( 30 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 207 ( 57 ~; 50 |; 88 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 32 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1016,plain,
$false,
inference(resolution,[],[f1015,f695]) ).
fof(f695,plain,
neq(sK20,nil),
inference(duplicate_literal_removal,[],[f693]) ).
fof(f693,plain,
( neq(sK20,nil)
| neq(sK20,nil) ),
inference(resolution,[],[f377,f644]) ).
fof(f644,plain,
( sP0(sK19,sK20,sK19,sK20)
| neq(sK20,nil) ),
inference(forward_demodulation,[],[f643,f386]) ).
fof(f386,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f257]) ).
fof(f257,plain,
( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,sK21,sK22) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22)
& ssList(sK21)
& ssList(sK20)
& ssList(sK19) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22])],[f224,f256,f255,f254,f253]) ).
fof(f253,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X1,X2,X3) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK19,X1,X2,X3) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK19,X1,X2,X3) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,X2,X3) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,X2,X3) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,sK21,X3) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,sK21,X3) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK19,sK20,sK21,sK22) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X1,X2,X3) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f223]) ).
fof(f223,plain,
! [X0,X1,X2,X3] :
( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& neq(X1,nil) )
| ~ sP0(X0,X1,X2,X3) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ~ segmentP(X3,X2)
| ~ neq(X2,nil)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f643,plain,
( sP0(sK19,sK20,sK21,sK20)
| neq(sK20,nil) ),
inference(forward_demodulation,[],[f387,f385]) ).
fof(f385,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f257]) ).
fof(f387,plain,
( neq(sK20,nil)
| sP0(sK19,sK20,sK21,sK22) ),
inference(cnf_transformation,[],[f257]) ).
fof(f377,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X1,nil) ),
inference(cnf_transformation,[],[f252]) ).
fof(f252,plain,
! [X0,X1,X2,X3] :
( ( ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& segmentP(X3,X2)
& neq(X2,nil)
& neq(X1,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(nnf_transformation,[],[f223]) ).
fof(f1015,plain,
~ neq(sK20,nil),
inference(resolution,[],[f1012,f697]) ).
fof(f697,plain,
( segmentP(sK20,sK19)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f379,f642]) ).
fof(f642,plain,
( sP0(sK19,sK20,sK19,sK20)
| ~ neq(sK20,nil) ),
inference(forward_demodulation,[],[f641,f386]) ).
fof(f641,plain,
( sP0(sK19,sK20,sK21,sK20)
| ~ neq(sK20,nil) ),
inference(forward_demodulation,[],[f640,f385]) ).
fof(f640,plain,
( ~ neq(sK20,nil)
| sP0(sK19,sK20,sK21,sK22) ),
inference(forward_demodulation,[],[f388,f385]) ).
fof(f388,plain,
( ~ neq(sK22,nil)
| sP0(sK19,sK20,sK21,sK22) ),
inference(cnf_transformation,[],[f257]) ).
fof(f379,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| segmentP(X3,X2) ),
inference(cnf_transformation,[],[f252]) ).
fof(f1012,plain,
~ segmentP(sK20,sK19),
inference(resolution,[],[f1011,f695]) ).
fof(f1011,plain,
( ~ neq(sK20,nil)
| ~ segmentP(sK20,sK19) ),
inference(duplicate_literal_removal,[],[f1008]) ).
fof(f1008,plain,
( ~ segmentP(sK20,sK19)
| ~ neq(sK20,nil)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f1007,f696]) ).
fof(f696,plain,
( neq(sK19,nil)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f378,f642]) ).
fof(f378,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X2,nil) ),
inference(cnf_transformation,[],[f252]) ).
fof(f1007,plain,
( ~ neq(sK19,nil)
| ~ segmentP(sK20,sK19)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f380,f642]) ).
fof(f380,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ neq(X0,nil)
| ~ segmentP(X1,X0) ),
inference(cnf_transformation,[],[f252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SWC121+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 04:09:21 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (28656)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (28659)WARNING: value z3 for option sas not known
% 0.12/0.36 % (28658)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.36 % (28660)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (28659)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.12/0.36 % (28662)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.12/0.36 % (28661)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.12/0.36 % (28663)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.12/0.36 % (28657)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.37 TRYING [1]
% 0.12/0.37 TRYING [2]
% 0.12/0.38 TRYING [1]
% 0.12/0.38 TRYING [2]
% 0.12/0.38 TRYING [1]
% 0.12/0.38 TRYING [2]
% 0.12/0.38 % (28662)First to succeed.
% 0.12/0.38 % (28659)Also succeeded, but the first one will report.
% 0.12/0.38 % (28662)Refutation found. Thanks to Tanya!
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.38 % (28662)------------------------------
% 0.12/0.38 % (28662)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.12/0.38 % (28662)Termination reason: Refutation
% 0.12/0.38
% 0.12/0.38 % (28662)Memory used [KB]: 1577
% 0.12/0.38 % (28662)Time elapsed: 0.024 s
% 0.12/0.38 % (28662)Instructions burned: 45 (million)
% 0.12/0.38 % (28662)------------------------------
% 0.12/0.38 % (28662)------------------------------
% 0.12/0.38 % (28656)Success in time 0.042 s
%------------------------------------------------------------------------------