TSTP Solution File: SWC276+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC276+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 : 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 : Wed Aug 31 18:40:04 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 201 ( 78 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 206 ( 42 ~; 41 |; 104 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 13 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f307,plain,
$false,
inference(avatar_sat_refutation,[],[f277,f288,f299,f306]) ).
fof(f306,plain,
~ spl17_3,
inference(avatar_contradiction_clause,[],[f305]) ).
fof(f305,plain,
( $false
| ~ spl17_3 ),
inference(subsumption_resolution,[],[f303,f219]) ).
fof(f219,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f303,plain,
( ~ totalorderedP(nil)
| ~ spl17_3 ),
inference(backward_demodulation,[],[f192,f272]) ).
fof(f272,plain,
( nil = sK1
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f270,plain,
( spl17_3
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_3])]) ).
fof(f192,plain,
~ totalorderedP(sK1),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
( ~ totalorderedP(sK1)
& sK4 = sK2
& sK3 = sK1
& ssList(sK4)
& ( ( memberP(sK4,sK5)
& sK3 = cons(sK5,nil)
& ssItem(sK5) )
| ( nil = sK3
& nil = sK4 ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f127,f144,f143,f142,f141,f140]) ).
fof(f140,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK1)
& X1 = X3
& sK1 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK1)
& X1 = X3
& sK1 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK1)
& sK2 = X3
& sK1 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(sK1)
& sK2 = X3
& sK1 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( ~ totalorderedP(sK1)
& sK2 = X3
& sK3 = sK1
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK3
& ssItem(X4) )
| ( nil = sK3
& nil = X3 ) ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X3] :
( ~ totalorderedP(sK1)
& sK2 = X3
& sK3 = sK1
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK3
& ssItem(X4) )
| ( nil = sK3
& nil = X3 ) ) )
=> ( ~ totalorderedP(sK1)
& sK4 = sK2
& sK3 = sK1
& ssList(sK4)
& ( ? [X4] :
( memberP(sK4,X4)
& cons(X4,nil) = sK3
& ssItem(X4) )
| ( nil = sK3
& nil = sK4 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
( ? [X4] :
( memberP(sK4,X4)
& cons(X4,nil) = sK3
& ssItem(X4) )
=> ( memberP(sK4,sK5)
& sK3 = cons(sK5,nil)
& ssItem(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ssList(X3)
& ( ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f126,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ totalorderedP(X0)
& X0 = X2
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ssItem(X4) ) )
& 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)
=> ( totalorderedP(X0)
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) ) )
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( totalorderedP(X0)
| X0 != X2
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4) ) ) )
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f299,plain,
( ~ spl17_4
| ~ spl17_6 ),
inference(avatar_contradiction_clause,[],[f298]) ).
fof(f298,plain,
( $false
| ~ spl17_4
| ~ spl17_6 ),
inference(subsumption_resolution,[],[f297,f192]) ).
fof(f297,plain,
( totalorderedP(sK1)
| ~ spl17_4
| ~ spl17_6 ),
inference(subsumption_resolution,[],[f296,f276]) ).
fof(f276,plain,
( ssItem(sK5)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl17_4
<=> ssItem(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f296,plain,
( totalorderedP(sK1)
| ~ ssItem(sK5)
| ~ spl17_6 ),
inference(superposition,[],[f233,f286]) ).
fof(f286,plain,
( cons(sK5,nil) = sK1
| ~ spl17_6 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl17_6
<=> cons(sK5,nil) = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).
fof(f233,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f288,plain,
( spl17_3
| spl17_6 ),
inference(avatar_split_clause,[],[f246,f284,f270]) ).
fof(f246,plain,
( cons(sK5,nil) = sK1
| nil = sK1 ),
inference(definition_unfolding,[],[f186,f190,f190]) ).
fof(f190,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f145]) ).
fof(f186,plain,
( sK3 = cons(sK5,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f145]) ).
fof(f277,plain,
( spl17_3
| spl17_4 ),
inference(avatar_split_clause,[],[f248,f274,f270]) ).
fof(f248,plain,
( ssItem(sK5)
| nil = sK1 ),
inference(definition_unfolding,[],[f184,f190]) ).
fof(f184,plain,
( ssItem(sK5)
| nil = sK3 ),
inference(cnf_transformation,[],[f145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC276+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % 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.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:51:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (10045)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (10045)Instruction limit reached!
% 0.19/0.51 % (10045)------------------------------
% 0.19/0.51 % (10045)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (10045)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (10045)Termination reason: Unknown
% 0.19/0.51 % (10045)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (10045)Memory used [KB]: 1535
% 0.19/0.51 % (10045)Time elapsed: 0.005 s
% 0.19/0.51 % (10045)Instructions burned: 3 (million)
% 0.19/0.51 % (10045)------------------------------
% 0.19/0.51 % (10045)------------------------------
% 0.19/0.52 % (10064)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.54 % (10050)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.19/0.55 % (10047)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.57 % (10047)First to succeed.
% 0.19/0.57 % (10047)Refutation found. Thanks to Tanya!
% 0.19/0.57 % SZS status Theorem for theBenchmark
% 0.19/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.58 % (10047)------------------------------
% 0.19/0.58 % (10047)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.58 % (10047)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.58 % (10047)Termination reason: Refutation
% 0.19/0.58
% 0.19/0.58 % (10047)Memory used [KB]: 6140
% 0.19/0.58 % (10047)Time elapsed: 0.143 s
% 0.19/0.58 % (10047)Instructions burned: 7 (million)
% 0.19/0.58 % (10047)------------------------------
% 0.19/0.58 % (10047)------------------------------
% 0.19/0.58 % (10042)Success in time 0.22 s
%------------------------------------------------------------------------------