TSTP Solution File: SWC203+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC203+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n027.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 : Wed Aug 31 18:39:35 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 9 unt; 0 def)
% Number of atoms : 114 ( 44 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 118 ( 22 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f139,plain,
$false,
inference(subsumption_resolution,[],[f134,f120]) ).
fof(f120,plain,
neq(sK3,nil),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
( ssList(sK2)
& ssList(sK3)
& ssList(sK4)
& sK2 = sK4
& ssList(sK5)
& ~ neq(sK2,nil)
& sK5 = sK3
& neq(sK3,nil)
& sK4 = sK5 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f100,f110,f109,f108,f107]) ).
fof(f107,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ~ neq(X0,nil)
& X1 = X3
& neq(X1,nil)
& X2 = X3 ) ) ) )
=> ( ssList(sK2)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ssList(X3)
& ~ neq(sK2,nil)
& X1 = X3
& neq(X1,nil)
& X2 = X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f108,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ssList(X3)
& ~ neq(sK2,nil)
& X1 = X3
& neq(X1,nil)
& X2 = X3 ) ) )
=> ( ssList(sK3)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ssList(X3)
& ~ neq(sK2,nil)
& sK3 = X3
& neq(sK3,nil)
& X2 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ssList(X3)
& ~ neq(sK2,nil)
& sK3 = X3
& neq(sK3,nil)
& X2 = X3 ) )
=> ( ssList(sK4)
& ? [X3] :
( sK2 = sK4
& ssList(X3)
& ~ neq(sK2,nil)
& sK3 = X3
& neq(sK3,nil)
& sK4 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( ? [X3] :
( sK2 = sK4
& ssList(X3)
& ~ neq(sK2,nil)
& sK3 = X3
& neq(sK3,nil)
& sK4 = X3 )
=> ( sK2 = sK4
& ssList(sK5)
& ~ neq(sK2,nil)
& sK5 = sK3
& neq(sK3,nil)
& sK4 = sK5 ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ~ neq(X0,nil)
& X1 = X3
& neq(X1,nil)
& X2 = X3 ) ) ) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ neq(X0,nil)
& X1 = X3
& X0 = X2
& X2 = X3
& neq(X1,nil)
& 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(X0,nil)
| X1 != X3
| X0 != X2
| X2 != X3
| ~ neq(X1,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| X1 != X3
| X0 != X2
| X2 != X3
| ~ neq(X1,nil) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f134,plain,
~ neq(sK3,nil),
inference(definition_unfolding,[],[f122,f130]) ).
fof(f130,plain,
sK2 = sK3,
inference(definition_unfolding,[],[f124,f129]) ).
fof(f129,plain,
sK4 = sK3,
inference(definition_unfolding,[],[f119,f121]) ).
fof(f121,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f111]) ).
fof(f119,plain,
sK4 = sK5,
inference(cnf_transformation,[],[f111]) ).
fof(f124,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f111]) ).
fof(f122,plain,
~ neq(sK2,nil),
inference(cnf_transformation,[],[f111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC203+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 18:49:01 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.50 % (24086)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.51 % (24091)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51 % (24104)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.51 % (24086)First to succeed.
% 0.21/0.51 % (24103)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.51 % (24088)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.52 % (24087)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.52 % (24107)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52 % (24094)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (24096)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.52 % (24086)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (24086)------------------------------
% 0.21/0.52 % (24086)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (24086)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (24086)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (24086)Memory used [KB]: 1535
% 0.21/0.52 % (24086)Time elapsed: 0.095 s
% 0.21/0.52 % (24086)Instructions burned: 2 (million)
% 0.21/0.52 % (24086)------------------------------
% 0.21/0.52 % (24086)------------------------------
% 0.21/0.52 % (24080)Success in time 0.151 s
%------------------------------------------------------------------------------