TSTP Solution File: SWC047+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC047+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 : n022.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:38:24 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 255 ( 81 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 330 ( 118 ~; 101 |; 95 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 56 ( 30 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f671,plain,
$false,
inference(avatar_sat_refutation,[],[f624,f634,f639,f642,f670]) ).
fof(f670,plain,
( ~ spl57_5
| ~ spl57_7 ),
inference(avatar_contradiction_clause,[],[f669]) ).
fof(f669,plain,
( $false
| ~ spl57_5
| ~ spl57_7 ),
inference(subsumption_resolution,[],[f668,f633]) ).
fof(f633,plain,
( neq(sK11,nil)
| ~ spl57_7 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f631,plain,
( spl57_7
<=> neq(sK11,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_7])]) ).
fof(f668,plain,
( ~ neq(sK11,nil)
| ~ spl57_5 ),
inference(subsumption_resolution,[],[f667,f390]) ).
fof(f390,plain,
ssList(sK11),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ssList(sK12)
& ssList(sK13)
& ssList(sK14)
& sK12 = sK14
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& sK14 = sK13
& sK13 = sK11
& ssList(sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13,sK14])],[f175,f255,f254,f253,f252]) ).
fof(f252,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil != X0
& nil = X1 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ ssList(X4)
| ~ rearsegP(X0,X4) ) ) )
& X2 = X3
& X0 = X2 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil != sK11
& nil = X1 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& X2 = X3
& sK11 = X2 ) ) )
& ssList(sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil != sK11
& nil = X1 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& X2 = X3
& sK11 = X2 ) ) )
=> ( ssList(sK12)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK12 = X3
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& X2 = X3
& sK11 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK12 = X3
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& X2 = X3
& sK11 = X2 ) )
=> ( ssList(sK13)
& ? [X3] :
( ssList(X3)
& sK12 = X3
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& sK13 = X3
& sK13 = sK11 ) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X3] :
( ssList(X3)
& sK12 = X3
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& sK13 = X3
& sK13 = sK11 )
=> ( ssList(sK14)
& sK12 = sK14
& ( ( nil != sK11
& nil = sK12 )
| ( neq(sK12,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ) ) )
& sK14 = sK13
& sK13 = sK11 ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X1 = X3
& ( ( nil != X0
& nil = X1 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ ssList(X4)
| ~ rearsegP(X0,X4) ) ) )
& X2 = X3
& X0 = X2 ) ) )
& ssList(X0) ),
inference(flattening,[],[f174]) ).
fof(f174,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X2 = X3
& X1 = X3
& ( ( nil != X0
& nil = X1 )
| ( neq(X1,nil)
& ! [X4] :
( ~ neq(X4,nil)
| ~ rearsegP(X1,X4)
| ~ ssList(X4)
| ~ rearsegP(X0,X4) ) ) )
& X0 = X2
& 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)
=> ( X2 != X3
| X1 != X3
| ( ( nil = X0
| nil != X1 )
& ( ? [X4] :
( rearsegP(X0,X4)
& ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X2 != X3
| X1 != X3
| ( ( nil = X0
| nil != X1 )
& ( ? [X4] :
( rearsegP(X0,X4)
& ssList(X4)
& neq(X4,nil)
& rearsegP(X1,X4) )
| ~ neq(X1,nil) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f667,plain,
( ~ ssList(sK11)
| ~ neq(sK11,nil)
| ~ spl57_5 ),
inference(duplicate_literal_removal,[],[f665]) ).
fof(f665,plain,
( ~ ssList(sK11)
| ~ neq(sK11,nil)
| ~ ssList(sK11)
| ~ spl57_5 ),
inference(resolution,[],[f623,f371]) ).
fof(f371,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax49) ).
fof(f623,plain,
( ! [X4] :
( ~ rearsegP(sK11,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f622]) ).
fof(f622,plain,
( spl57_5
<=> ! [X4] :
( ~ ssList(X4)
| ~ rearsegP(sK11,X4)
| ~ neq(X4,nil) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_5])]) ).
fof(f642,plain,
( ~ spl57_4
| spl57_5 ),
inference(avatar_split_clause,[],[f595,f622,f618]) ).
fof(f618,plain,
( spl57_4
<=> nil = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl57_4])]) ).
fof(f595,plain,
! [X4] :
( ~ rearsegP(sK11,X4)
| nil != sK11
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(duplicate_literal_removal,[],[f564]) ).
fof(f564,plain,
! [X4] :
( ~ rearsegP(sK11,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| nil != sK11
| ~ rearsegP(sK11,X4) ),
inference(definition_unfolding,[],[f395,f559]) ).
fof(f559,plain,
sK12 = sK11,
inference(definition_unfolding,[],[f397,f558]) ).
fof(f558,plain,
sK14 = sK11,
inference(definition_unfolding,[],[f392,f391]) ).
fof(f391,plain,
sK13 = sK11,
inference(cnf_transformation,[],[f256]) ).
fof(f392,plain,
sK14 = sK13,
inference(cnf_transformation,[],[f256]) ).
fof(f397,plain,
sK12 = sK14,
inference(cnf_transformation,[],[f256]) ).
fof(f395,plain,
! [X4] :
( nil != sK11
| ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ),
inference(cnf_transformation,[],[f256]) ).
fof(f639,plain,
( ~ spl57_4
| spl57_7 ),
inference(avatar_split_clause,[],[f563,f631,f618]) ).
fof(f563,plain,
( neq(sK11,nil)
| nil != sK11 ),
inference(definition_unfolding,[],[f396,f559]) ).
fof(f396,plain,
( nil != sK11
| neq(sK12,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f634,plain,
( spl57_4
| spl57_7 ),
inference(avatar_split_clause,[],[f565,f631,f618]) ).
fof(f565,plain,
( neq(sK11,nil)
| nil = sK11 ),
inference(definition_unfolding,[],[f394,f559,f559]) ).
fof(f394,plain,
( nil = sK12
| neq(sK12,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f624,plain,
( spl57_4
| spl57_5 ),
inference(avatar_split_clause,[],[f597,f622,f618]) ).
fof(f597,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK11,X4)
| nil = sK11 ),
inference(duplicate_literal_removal,[],[f566]) ).
fof(f566,plain,
! [X4] :
( ~ rearsegP(sK11,X4)
| ~ neq(X4,nil)
| ~ rearsegP(sK11,X4)
| ~ ssList(X4)
| nil = sK11 ),
inference(definition_unfolding,[],[f393,f559,f559]) ).
fof(f393,plain,
! [X4] :
( nil = sK12
| ~ neq(X4,nil)
| ~ rearsegP(sK12,X4)
| ~ ssList(X4)
| ~ rearsegP(sK11,X4) ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SWC047+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:01:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.47 % (5804)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.47 % (5788)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.18/0.48 % (5788)First to succeed.
% 0.18/0.48 % (5794)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.18/0.48 % (5796)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.18/0.49 % (5810)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.18/0.49 % (5802)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.49 % (5802)Instruction limit reached!
% 0.18/0.49 % (5802)------------------------------
% 0.18/0.49 % (5802)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (5802)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (5802)Termination reason: Unknown
% 0.18/0.49 % (5802)Termination phase: Preprocessing 3
% 0.18/0.49
% 0.18/0.49 % (5802)Memory used [KB]: 1535
% 0.18/0.49 % (5802)Time elapsed: 0.004 s
% 0.18/0.49 % (5802)Instructions burned: 3 (million)
% 0.18/0.49 % (5802)------------------------------
% 0.18/0.49 % (5802)------------------------------
% 0.18/0.50 % (5811)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.18/0.50 % (5794)Also succeeded, but the first one will report.
% 0.18/0.50 % (5788)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (5788)------------------------------
% 0.18/0.50 % (5788)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (5788)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (5788)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (5788)Memory used [KB]: 6396
% 0.18/0.50 % (5788)Time elapsed: 0.088 s
% 0.18/0.50 % (5788)Instructions burned: 13 (million)
% 0.18/0.50 % (5788)------------------------------
% 0.18/0.50 % (5788)------------------------------
% 0.18/0.50 % (5783)Success in time 0.161 s
%------------------------------------------------------------------------------