TSTP Solution File: SWC020+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC020+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 : n031.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:46:56 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 11 unt; 0 def)
% Number of atoms : 280 ( 107 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 364 ( 129 ~; 109 |; 109 &)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 61 ( 35 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f669,plain,
$false,
inference(trivial_inequality_removal,[],[f668]) ).
fof(f668,plain,
nil != nil,
inference(superposition,[],[f657,f665]) ).
fof(f665,plain,
nil = sK19,
inference(backward_demodulation,[],[f378,f663]) ).
fof(f663,plain,
nil = sK21,
inference(resolution,[],[f662,f394]) ).
fof(f394,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f662,plain,
( ~ ssList(nil)
| nil = sK21 ),
inference(resolution,[],[f652,f631]) ).
fof(f631,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f624]) ).
fof(f624,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f573]) ).
fof(f573,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(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(f652,plain,
( neq(nil,nil)
| nil = sK21 ),
inference(backward_demodulation,[],[f382,f649]) ).
fof(f649,plain,
nil = sK20,
inference(resolution,[],[f648,f376]) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK18
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK18
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( nil != sK18
| nil != sK19 )
& ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f648,plain,
( ~ ssList(sK20)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f647]) ).
fof(f647,plain,
( ~ ssList(sK20)
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f646,f452]) ).
fof(f452,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f646,plain,
( ~ frontsegP(sK20,sK20)
| ~ ssList(sK20)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f644]) ).
fof(f644,plain,
( ~ frontsegP(sK20,sK20)
| ~ ssList(sK20)
| nil = sK20
| nil = sK20 ),
inference(resolution,[],[f642,f385]) ).
fof(f385,plain,
( frontsegP(sK21,sK20)
| nil = sK20 ),
inference(cnf_transformation,[],[f254]) ).
fof(f642,plain,
( ~ frontsegP(sK21,sK20)
| ~ frontsegP(sK20,sK20)
| ~ ssList(sK20)
| nil = sK20 ),
inference(resolution,[],[f639,f383]) ).
fof(f383,plain,
( neq(sK20,nil)
| nil = sK20 ),
inference(cnf_transformation,[],[f254]) ).
fof(f639,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK20,X4)
| ~ frontsegP(sK21,X4)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f638,f378]) ).
fof(f638,plain,
! [X4] :
( ~ frontsegP(sK20,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f380,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f380,plain,
! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f254]) ).
fof(f382,plain,
( neq(sK20,nil)
| nil = sK21 ),
inference(cnf_transformation,[],[f254]) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f657,plain,
nil != sK19,
inference(trivial_inequality_removal,[],[f654]) ).
fof(f654,plain,
( nil != nil
| nil != sK19 ),
inference(backward_demodulation,[],[f637,f649]) ).
fof(f637,plain,
( nil != sK20
| nil != sK19 ),
inference(forward_demodulation,[],[f381,f379]) ).
fof(f381,plain,
( nil != sK18
| nil != sK19 ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC020+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.34 % Computer : n031.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Apr 30 04:49:58 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % (2234)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.36 % (2238)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37 % (2237)WARNING: value z3 for option sas not known
% 0.15/0.37 % (2235)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37 % (2236)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37 % (2237)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.37 % (2240)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.37 % (2239)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.37 % (2241)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.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.20/0.38 % (2240)First to succeed.
% 0.20/0.38 TRYING [3]
% 0.20/0.38 % (2240)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.38 % (2240)------------------------------
% 0.20/0.38 % (2240)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.38 % (2240)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (2240)Memory used [KB]: 1319
% 0.20/0.38 % (2240)Time elapsed: 0.014 s
% 0.20/0.38 % (2240)Instructions burned: 22 (million)
% 0.20/0.38 % (2240)------------------------------
% 0.20/0.38 % (2240)------------------------------
% 0.20/0.38 % (2234)Success in time 0.033 s
%------------------------------------------------------------------------------