TSTP Solution File: SWC210+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC210+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 : n028.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:10:59 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 12 unt; 0 def)
% Number of atoms : 197 ( 39 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 214 ( 61 ~; 52 |; 85 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 62 ( 34 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1026,plain,
$false,
inference(resolution,[],[f1022,f649]) ).
fof(f649,plain,
neq(sK20,nil),
inference(duplicate_literal_removal,[],[f647]) ).
fof(f647,plain,
( neq(sK20,nil)
| neq(sK20,nil) ),
inference(resolution,[],[f378,f642]) ).
fof(f642,plain,
( sP0(sK19,sK19,sK20)
| neq(sK20,nil) ),
inference(forward_demodulation,[],[f387,f386]) ).
fof(f386,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f258]) ).
fof(f258,plain,
( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK19,sK21,sK20) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22)
& ssList(sK21)
& ssList(sK20)
& ssList(sK19) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22])],[f224,f257,f256,f255,f254]) ).
fof(f254,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X2,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK19,X2,X1) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(sK19,X2,X1) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,X2,sK20) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,X2,sK20) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK21,sK20) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK19,sK21,sK20) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK19,sK21,sK20) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X0,X2,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f223]) ).
fof(f223,plain,
! [X0,X2,X1] :
( ( ~ neq(X0,nil)
& singletonP(X2)
& neq(X1,nil) )
| ~ sP0(X0,X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(X0,nil)
& singletonP(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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(X0,nil)
& singletonP(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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( neq(X0,nil)
| ~ singletonP(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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( neq(X0,nil)
| ~ singletonP(X2)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f387,plain,
( neq(sK20,nil)
| sP0(sK19,sK21,sK20) ),
inference(cnf_transformation,[],[f258]) ).
fof(f378,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| neq(X2,nil) ),
inference(cnf_transformation,[],[f253]) ).
fof(f253,plain,
! [X0,X1,X2] :
( ( ~ neq(X0,nil)
& singletonP(X1)
& neq(X2,nil) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f252]) ).
fof(f252,plain,
! [X0,X2,X1] :
( ( ~ neq(X0,nil)
& singletonP(X2)
& neq(X1,nil) )
| ~ sP0(X0,X2,X1) ),
inference(nnf_transformation,[],[f223]) ).
fof(f1022,plain,
~ neq(sK20,nil),
inference(resolution,[],[f991,f389]) ).
fof(f389,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax39) ).
fof(f991,plain,
( singletonP(nil)
| ~ neq(sK20,nil) ),
inference(backward_demodulation,[],[f646,f987]) ).
fof(f987,plain,
nil = sK19,
inference(resolution,[],[f986,f397]) ).
fof(f397,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f986,plain,
( ~ ssList(nil)
| nil = sK19 ),
inference(resolution,[],[f982,f644]) ).
fof(f644,plain,
ssList(sK19),
inference(forward_demodulation,[],[f383,f386]) ).
fof(f383,plain,
ssList(sK21),
inference(cnf_transformation,[],[f258]) ).
fof(f982,plain,
( ~ ssList(sK19)
| ~ ssList(nil)
| nil = sK19 ),
inference(resolution,[],[f973,f649]) ).
fof(f973,plain,
( ~ neq(sK20,nil)
| ~ ssList(nil)
| ~ ssList(sK19)
| nil = sK19 ),
inference(resolution,[],[f577,f650]) ).
fof(f650,plain,
( ~ neq(sK19,nil)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f380,f641]) ).
fof(f641,plain,
( sP0(sK19,sK19,sK20)
| ~ neq(sK20,nil) ),
inference(forward_demodulation,[],[f640,f386]) ).
fof(f640,plain,
( ~ neq(sK20,nil)
| sP0(sK19,sK21,sK20) ),
inference(forward_demodulation,[],[f388,f385]) ).
fof(f385,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f258]) ).
fof(f388,plain,
( ~ neq(sK22,nil)
| sP0(sK19,sK21,sK20) ),
inference(cnf_transformation,[],[f258]) ).
fof(f380,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f253]) ).
fof(f577,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f359]) ).
fof(f359,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(f646,plain,
( singletonP(sK19)
| ~ neq(sK20,nil) ),
inference(resolution,[],[f379,f641]) ).
fof(f379,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| singletonP(X1) ),
inference(cnf_transformation,[],[f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC210+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.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 04:33:14 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (3301)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (3304)WARNING: value z3 for option sas not known
% 0.15/0.38 % (3305)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (3307)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 % (3306)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 % (3308)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.38 % (3303)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 % (3302)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (3304)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.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 % (3307)First to succeed.
% 0.15/0.40 % (3307)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (3307)------------------------------
% 0.15/0.40 % (3307)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.40 % (3307)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (3307)Memory used [KB]: 1576
% 0.15/0.40 % (3307)Time elapsed: 0.026 s
% 0.15/0.40 % (3307)Instructions burned: 44 (million)
% 0.15/0.40 % (3307)------------------------------
% 0.15/0.40 % (3307)------------------------------
% 0.15/0.40 % (3301)Success in time 0.035 s
%------------------------------------------------------------------------------