TSTP Solution File: SWC275+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC275+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 : n017.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.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 58 ( 11 unt; 0 def)
% Number of atoms : 261 ( 82 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 298 ( 95 ~; 83 |; 97 &)
% ( 9 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 53 ( 23 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f357,plain,
$false,
inference(avatar_sat_refutation,[],[f287,f288,f297,f306,f307,f342,f346,f354]) ).
fof(f354,plain,
( ~ spl17_5
| ~ spl17_8
| ~ spl17_9 ),
inference(avatar_contradiction_clause,[],[f353]) ).
fof(f353,plain,
( $false
| ~ spl17_5
| ~ spl17_8
| ~ spl17_9 ),
inference(subsumption_resolution,[],[f352,f189]) ).
fof(f189,plain,
~ totalorderedP(sK1),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
( ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ neq(sK4,nil)
| ( cons(sK5,nil) = sK3
& ssItem(sK5)
& memberP(sK4,sK5) ) )
& ~ totalorderedP(sK1)
& sK2 = sK4
& sK3 = sK1
& ( nil != sK4
| nil = sK3 )
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f98,f148,f147,f146,f145,f144]) ).
fof(f144,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) ) ) )
=> ( ssList(sK1)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& X1 = X3
& sK1 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& X1 = X3
& sK1 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) ) )
=> ( ssList(sK2)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& sK2 = X3
& sK1 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& sK2 = X3
& sK1 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) )
=> ( ssList(sK3)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = sK3
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& sK2 = X3
& sK3 = sK1
& ( nil != X3
| nil = sK3 )
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = sK3
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(sK1)
& sK2 = X3
& sK3 = sK1
& ( nil != X3
| nil = sK3 )
& ssList(X3) )
=> ( ( ~ neq(sK4,nil)
| ? [X4] :
( cons(X4,nil) = sK3
& ssItem(X4)
& memberP(sK4,X4) ) )
& ~ totalorderedP(sK1)
& sK2 = sK4
& sK3 = sK1
& ( nil != sK4
| nil = sK3 )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X4] :
( cons(X4,nil) = sK3
& ssItem(X4)
& memberP(sK4,X4) )
=> ( cons(sK5,nil) = sK3
& ssItem(sK5)
& memberP(sK4,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& ~ totalorderedP(X0)
& X1 = X3
& X0 = X2
& ( nil != X3
| nil = X2 )
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| X0 != X2
| totalorderedP(X0)
| ~ ssList(X3)
| ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| cons(X4,nil) != X2 ) )
| ( nil = X3
& nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| X0 != X2
| totalorderedP(X0)
| ~ ssList(X3)
| ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| ~ ssItem(X4)
| cons(X4,nil) != X2 ) )
| ( nil = X3
& nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f352,plain,
( totalorderedP(sK1)
| ~ spl17_5
| ~ spl17_8
| ~ spl17_9 ),
inference(subsumption_resolution,[],[f347,f305]) ).
fof(f305,plain,
( ssItem(sK5)
| ~ spl17_9 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f303,plain,
( spl17_9
<=> ssItem(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_9])]) ).
fof(f347,plain,
( ~ ssItem(sK5)
| totalorderedP(sK1)
| ~ spl17_5
| ~ spl17_8 ),
inference(superposition,[],[f300,f286]) ).
fof(f286,plain,
( cons(sK5,nil) = sK1
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl17_5
<=> cons(sK5,nil) = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).
fof(f300,plain,
( ! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl17_8 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f299,plain,
( spl17_8
<=> ! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_8])]) ).
fof(f346,plain,
~ spl17_6,
inference(avatar_contradiction_clause,[],[f345]) ).
fof(f345,plain,
( $false
| ~ spl17_6 ),
inference(subsumption_resolution,[],[f344,f243]) ).
fof(f243,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f344,plain,
( ~ totalorderedP(nil)
| ~ spl17_6 ),
inference(backward_demodulation,[],[f189,f292]) ).
fof(f292,plain,
( nil = sK1
| ~ spl17_6 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f290,plain,
( spl17_6
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).
fof(f342,plain,
( spl17_7
| spl17_2
| ~ spl17_4 ),
inference(avatar_split_clause,[],[f341,f279,f270,f294]) ).
fof(f294,plain,
( spl17_7
<=> nil = sK4 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_7])]) ).
fof(f270,plain,
( spl17_2
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f279,plain,
( spl17_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f341,plain,
( nil = sK4
| spl17_2
| ~ spl17_4 ),
inference(subsumption_resolution,[],[f340,f280]) ).
fof(f280,plain,
( ssList(nil)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f340,plain,
( nil = sK4
| ~ ssList(nil)
| spl17_2 ),
inference(subsumption_resolution,[],[f331,f185]) ).
fof(f185,plain,
ssList(sK4),
inference(cnf_transformation,[],[f149]) ).
fof(f331,plain,
( ~ ssList(sK4)
| nil = sK4
| ~ ssList(nil)
| spl17_2 ),
inference(resolution,[],[f198,f272]) ).
fof(f272,plain,
( ~ neq(sK4,nil)
| spl17_2 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f198,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) ) ),
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(f307,plain,
spl17_8,
inference(avatar_split_clause,[],[f226,f299]) ).
fof(f226,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ~ ssItem(X0)
| totalorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f306,plain,
( spl17_9
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f191,f270,f303]) ).
fof(f191,plain,
( ~ neq(sK4,nil)
| ssItem(sK5) ),
inference(cnf_transformation,[],[f149]) ).
fof(f297,plain,
( spl17_6
| ~ spl17_7 ),
inference(avatar_split_clause,[],[f251,f294,f290]) ).
fof(f251,plain,
( nil != sK4
| nil = sK1 ),
inference(definition_unfolding,[],[f186,f187]) ).
fof(f187,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f149]) ).
fof(f186,plain,
( nil != sK4
| nil = sK3 ),
inference(cnf_transformation,[],[f149]) ).
fof(f288,plain,
spl17_4,
inference(avatar_split_clause,[],[f222,f279]) ).
fof(f222,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f287,plain,
( ~ spl17_2
| spl17_5 ),
inference(avatar_split_clause,[],[f250,f284,f270]) ).
fof(f250,plain,
( cons(sK5,nil) = sK1
| ~ neq(sK4,nil) ),
inference(definition_unfolding,[],[f192,f187]) ).
fof(f192,plain,
( ~ neq(sK4,nil)
| cons(sK5,nil) = sK3 ),
inference(cnf_transformation,[],[f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC275+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 : n017.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:06:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.51 % (22653)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.19/0.51 % (22661)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.19/0.52 % (22669)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.19/0.52 % (22648)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52 % (22652)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.19/0.53 % (22661)Instruction limit reached!
% 0.19/0.53 % (22661)------------------------------
% 0.19/0.53 % (22661)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (22661)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (22661)Termination reason: Unknown
% 0.19/0.53 % (22661)Termination phase: Preprocessing 3
% 0.19/0.53
% 0.19/0.53 % (22661)Memory used [KB]: 1663
% 0.19/0.53 % (22661)Time elapsed: 0.005 s
% 0.19/0.53 % (22661)Instructions burned: 4 (million)
% 0.19/0.53 % (22661)------------------------------
% 0.19/0.53 % (22661)------------------------------
% 0.19/0.53 % (22647)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.19/0.53 % (22649)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.53 % (22653)First to succeed.
% 0.19/0.53 % (22653)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (22653)------------------------------
% 0.19/0.53 % (22653)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (22653)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (22653)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (22653)Memory used [KB]: 6140
% 0.19/0.53 % (22653)Time elapsed: 0.122 s
% 0.19/0.53 % (22653)Instructions burned: 7 (million)
% 0.19/0.53 % (22653)------------------------------
% 0.19/0.53 % (22653)------------------------------
% 0.19/0.53 % (22646)Success in time 0.18 s
%------------------------------------------------------------------------------