TSTP Solution File: SWC286+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC286+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_sat --cores 0 -t %d %s
% Computer : n012.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:42:54 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 37 ( 7 unt; 0 def)
% Number of atoms : 249 ( 87 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 298 ( 86 ~; 84 |; 112 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 27 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f723,plain,
$false,
inference(avatar_sat_refutation,[],[f645,f651,f663,f700,f722]) ).
fof(f722,plain,
~ spl58_9,
inference(avatar_contradiction_clause,[],[f721]) ).
fof(f721,plain,
( $false
| ~ spl58_9 ),
inference(subsumption_resolution,[],[f719,f532]) ).
fof(f532,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f719,plain,
( ~ strictorderedP(nil)
| ~ spl58_9 ),
inference(backward_demodulation,[],[f549,f643]) ).
fof(f643,plain,
( nil = sK53
| ~ spl58_9 ),
inference(avatar_component_clause,[],[f641]) ).
fof(f641,plain,
( spl58_9
<=> nil = sK53 ),
introduced(avatar_definition,[new_symbols(naming,[spl58_9])]) ).
fof(f549,plain,
~ strictorderedP(sK53),
inference(cnf_transformation,[],[f344]) ).
fof(f344,plain,
( ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ~ strictorderedP(sK53)
& sK54 = sK56
& ( ( nil = sK55
& nil = sK56 )
| ( ! [X5] :
( sK57 = X5
| ~ memberP(sK56,X5)
| ~ ssItem(X5)
| ~ leq(sK57,X5) )
& sK55 = cons(sK57,nil)
& ssItem(sK57)
& memberP(sK56,sK57) ) )
& sK55 = sK53
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f159,f343,f342,f341,f340,f339]) ).
fof(f339,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(X0)
& X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& X0 = X2 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK53 = X2 ) ) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f340,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK53 = X2 ) ) )
=> ( ssList(sK54)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& sK54 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK53 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f341,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& sK54 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& sK53 = X2 ) )
=> ( ssList(sK55)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& sK54 = X3
& ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK55
& ssItem(X4)
& memberP(X3,X4) ) )
& sK55 = sK53 ) ) ),
introduced(choice_axiom,[]) ).
fof(f342,plain,
( ? [X3] :
( ssList(X3)
& ~ strictorderedP(sK53)
& sK54 = X3
& ( ( nil = sK55
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK55
& ssItem(X4)
& memberP(X3,X4) ) )
& sK55 = sK53 )
=> ( ssList(sK56)
& ~ strictorderedP(sK53)
& sK54 = sK56
& ( ( nil = sK55
& nil = sK56 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(sK56,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK55
& ssItem(X4)
& memberP(sK56,X4) ) )
& sK55 = sK53 ) ),
introduced(choice_axiom,[]) ).
fof(f343,plain,
( ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(sK56,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = sK55
& ssItem(X4)
& memberP(sK56,X4) )
=> ( ! [X5] :
( sK57 = X5
| ~ memberP(sK56,X5)
| ~ ssItem(X5)
| ~ leq(sK57,X5) )
& sK55 = cons(sK57,nil)
& ssItem(sK57)
& memberP(sK56,sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ strictorderedP(X0)
& X1 = X3
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( X4 = X5
| ~ memberP(X3,X5)
| ~ ssItem(X5)
| ~ leq(X4,X5) )
& cons(X4,nil) = X2
& ssItem(X4)
& memberP(X3,X4) ) )
& X0 = X2 ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& ssItem(X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| ~ ssList(X3)
| strictorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& ssItem(X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| ~ ssList(X3)
| strictorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f700,plain,
( ~ spl58_8
| ~ spl58_2
| ~ spl58_7 ),
inference(avatar_split_clause,[],[f699,f631,f608,f635]) ).
fof(f635,plain,
( spl58_8
<=> ssItem(sK57) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_8])]) ).
fof(f608,plain,
( spl58_2
<=> sK53 = cons(sK57,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_2])]) ).
fof(f631,plain,
( spl58_7
<=> ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl58_7])]) ).
fof(f699,plain,
( ~ ssItem(sK57)
| ~ spl58_2
| ~ spl58_7 ),
inference(subsumption_resolution,[],[f685,f549]) ).
fof(f685,plain,
( strictorderedP(sK53)
| ~ ssItem(sK57)
| ~ spl58_2
| ~ spl58_7 ),
inference(superposition,[],[f632,f610]) ).
fof(f610,plain,
( sK53 = cons(sK57,nil)
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f608]) ).
fof(f632,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f631]) ).
fof(f663,plain,
spl58_7,
inference(avatar_split_clause,[],[f368,f631]) ).
fof(f368,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f651,plain,
( spl58_2
| spl58_9 ),
inference(avatar_split_clause,[],[f565,f641,f608]) ).
fof(f565,plain,
( nil = sK53
| sK53 = cons(sK57,nil) ),
inference(definition_unfolding,[],[f546,f539,f539]) ).
fof(f539,plain,
sK55 = sK53,
inference(cnf_transformation,[],[f344]) ).
fof(f546,plain,
( nil = sK55
| sK55 = cons(sK57,nil) ),
inference(cnf_transformation,[],[f344]) ).
fof(f645,plain,
( spl58_9
| spl58_8 ),
inference(avatar_split_clause,[],[f566,f635,f641]) ).
fof(f566,plain,
( ssItem(sK57)
| nil = sK53 ),
inference(definition_unfolding,[],[f545,f539]) ).
fof(f545,plain,
( nil = sK55
| ssItem(sK57) ),
inference(cnf_transformation,[],[f344]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SWC286+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:42:35 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.47 % (17213)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48 % (17205)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.48 % (17220)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.48 % (17205)Instruction limit reached!
% 0.19/0.48 % (17205)------------------------------
% 0.19/0.48 % (17205)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (17205)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (17205)Termination reason: Unknown
% 0.19/0.48 % (17205)Termination phase: Preprocessing 2
% 0.19/0.48
% 0.19/0.48 % (17205)Memory used [KB]: 1023
% 0.19/0.48 % (17205)Time elapsed: 0.003 s
% 0.19/0.48 % (17205)Instructions burned: 2 (million)
% 0.19/0.48 % (17205)------------------------------
% 0.19/0.48 % (17205)------------------------------
% 0.19/0.49 % (17204)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.49 % (17213)First to succeed.
% 0.19/0.49 % (17213)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (17213)------------------------------
% 0.19/0.49 % (17213)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (17213)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (17213)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (17213)Memory used [KB]: 6012
% 0.19/0.49 % (17213)Time elapsed: 0.096 s
% 0.19/0.49 % (17213)Instructions burned: 14 (million)
% 0.19/0.49 % (17213)------------------------------
% 0.19/0.49 % (17213)------------------------------
% 0.19/0.49 % (17196)Success in time 0.147 s
%------------------------------------------------------------------------------