TSTP Solution File: SWC294+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC294+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:12 EDT 2022
% Result : Theorem 0.16s 0.43s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 67 ( 15 unt; 0 def)
% Number of atoms : 257 ( 56 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 288 ( 98 ~; 83 |; 82 &)
% ( 9 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 34 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f302,plain,
$false,
inference(avatar_sat_refutation,[],[f209,f257,f271,f294]) ).
fof(f294,plain,
~ spl12_8,
inference(avatar_contradiction_clause,[],[f293]) ).
fof(f293,plain,
( $false
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f286,f184]) ).
fof(f184,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f286,plain,
( ~ strictorderedP(nil)
| ~ spl12_8 ),
inference(backward_demodulation,[],[f182,f284]) ).
fof(f284,plain,
( nil = sK8
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f280,f175]) ).
fof(f175,plain,
ssList(sK8),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
( ssList(sK9)
& ~ strictorderedP(sK8)
& sK9 = sK11
& ( ~ neq(sK11,nil)
| singletonP(sK10) )
& ssList(sK11)
& segmentP(sK11,sK10)
& sK10 = sK8
& ssList(sK10)
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11])],[f100,f141,f140,f139,f138]) ).
fof(f138,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ strictorderedP(X0)
& X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK8)
& X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& sK8 = X2 )
& ssList(X2) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK8)
& X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& sK8 = X2 )
& ssList(X2) ) )
=> ( ssList(sK9)
& ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK8)
& sK9 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& sK8 = X2 )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK8)
& sK9 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& sK8 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ~ strictorderedP(sK8)
& sK9 = X3
& ( ~ neq(X3,nil)
| singletonP(sK10) )
& ssList(X3)
& segmentP(X3,sK10)
& sK10 = sK8 )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X3] :
( ~ strictorderedP(sK8)
& sK9 = X3
& ( ~ neq(X3,nil)
| singletonP(sK10) )
& ssList(X3)
& segmentP(X3,sK10)
& sK10 = sK8 )
=> ( ~ strictorderedP(sK8)
& sK9 = sK11
& ( ~ neq(sK11,nil)
| singletonP(sK10) )
& ssList(sK11)
& segmentP(sK11,sK10)
& sK10 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ~ strictorderedP(X0)
& X1 = X3
& ( ~ neq(X3,nil)
| singletonP(X2) )
& ssList(X3)
& segmentP(X3,X2)
& X0 = X2 )
& ssList(X2) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| ( ~ singletonP(X2)
& neq(X3,nil) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| strictorderedP(X0)
| ~ segmentP(X3,X2)
| ( ~ singletonP(X2)
& neq(X3,nil) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f280,plain,
( nil = sK8
| ~ ssList(sK8)
| ~ spl12_8 ),
inference(resolution,[],[f273,f170]) ).
fof(f170,plain,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f273,plain,
( segmentP(nil,sK8)
| ~ spl12_8 ),
inference(backward_demodulation,[],[f189,f249]) ).
fof(f249,plain,
( nil = sK11
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f247,plain,
( spl12_8
<=> nil = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f189,plain,
segmentP(sK11,sK8),
inference(definition_unfolding,[],[f178,f177]) ).
fof(f177,plain,
sK10 = sK8,
inference(cnf_transformation,[],[f142]) ).
fof(f178,plain,
segmentP(sK11,sK10),
inference(cnf_transformation,[],[f142]) ).
fof(f182,plain,
~ strictorderedP(sK8),
inference(cnf_transformation,[],[f142]) ).
fof(f271,plain,
~ spl12_1,
inference(avatar_contradiction_clause,[],[f270]) ).
fof(f270,plain,
( $false
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f269,f175]) ).
fof(f269,plain,
( ~ ssList(sK8)
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f268,f204]) ).
fof(f204,plain,
( singletonP(sK8)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl12_1
<=> singletonP(sK8) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f268,plain,
( ~ singletonP(sK8)
| ~ ssList(sK8)
| ~ spl12_1 ),
inference(resolution,[],[f267,f153]) ).
fof(f153,plain,
! [X0] :
( ssItem(sK2(X0))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ( cons(sK2(X0),nil) = X0
& ssItem(sK2(X0)) )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( cons(X2,nil) != X0
| ~ ssItem(X2) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f124,f125]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
=> ( cons(sK2(X0),nil) = X0
& ssItem(sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X2] :
( cons(X2,nil) != X0
| ~ ssItem(X2) ) ) ) ),
inference(rectify,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) )
& ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) ) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ~ ssList(X0)
| ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
<=> singletonP(X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
<=> singletonP(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).
fof(f267,plain,
( ~ ssItem(sK2(sK8))
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f260,f182]) ).
fof(f260,plain,
( ~ ssItem(sK2(sK8))
| strictorderedP(sK8)
| ~ spl12_1 ),
inference(superposition,[],[f157,f259]) ).
fof(f259,plain,
( sK8 = cons(sK2(sK8),nil)
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f258,f175]) ).
fof(f258,plain,
( sK8 = cons(sK2(sK8),nil)
| ~ ssList(sK8)
| ~ spl12_1 ),
inference(resolution,[],[f204,f154]) ).
fof(f154,plain,
! [X0] :
( ~ singletonP(X0)
| ~ ssList(X0)
| cons(sK2(X0),nil) = X0 ),
inference(cnf_transformation,[],[f126]) ).
fof(f157,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,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(f257,plain,
( spl12_8
| spl12_2 ),
inference(avatar_split_clause,[],[f256,f206,f247]) ).
fof(f206,plain,
( spl12_2
<=> neq(sK11,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f256,plain,
( nil = sK11
| spl12_2 ),
inference(subsumption_resolution,[],[f255,f187]) ).
fof(f187,plain,
ssList(sK11),
inference(definition_unfolding,[],[f183,f181]) ).
fof(f181,plain,
sK9 = sK11,
inference(cnf_transformation,[],[f142]) ).
fof(f183,plain,
ssList(sK9),
inference(cnf_transformation,[],[f142]) ).
fof(f255,plain,
( ~ ssList(sK11)
| nil = sK11
| spl12_2 ),
inference(subsumption_resolution,[],[f241,f169]) ).
fof(f169,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f241,plain,
( ~ ssList(nil)
| nil = sK11
| ~ ssList(sK11)
| spl12_2 ),
inference(resolution,[],[f208,f174]) ).
fof(f174,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f208,plain,
( ~ neq(sK11,nil)
| spl12_2 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f209,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f188,f206,f202]) ).
fof(f188,plain,
( ~ neq(sK11,nil)
| singletonP(sK8) ),
inference(definition_unfolding,[],[f180,f177]) ).
fof(f180,plain,
( ~ neq(sK11,nil)
| singletonP(sK10) ),
inference(cnf_transformation,[],[f142]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWC294+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 18:08:50 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.40 % (27393)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.41 % (27391)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.16/0.41 % (27392)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.16/0.41 % (27392)Instruction limit reached!
% 0.16/0.41 % (27392)------------------------------
% 0.16/0.41 % (27392)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.41 % (27402)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.16/0.42 % (27402)Instruction limit reached!
% 0.16/0.42 % (27402)------------------------------
% 0.16/0.42 % (27402)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.42 % (27403)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.16/0.42 % (27394)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.16/0.42 % (27390)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.16/0.42 % (27392)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.42 % (27392)Termination reason: Unknown
% 0.16/0.42 % (27392)Termination phase: Preprocessing 3
% 0.16/0.42
% 0.16/0.42 % (27392)Memory used [KB]: 1535
% 0.16/0.42 % (27392)Time elapsed: 0.003 s
% 0.16/0.42 % (27392)Instructions burned: 3 (million)
% 0.16/0.42 % (27392)------------------------------
% 0.16/0.42 % (27392)------------------------------
% 0.16/0.42 % (27406)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.16/0.43 % (27391)First to succeed.
% 0.16/0.43 % (27391)Refutation found. Thanks to Tanya!
% 0.16/0.43 % SZS status Theorem for theBenchmark
% 0.16/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.43 % (27391)------------------------------
% 0.16/0.43 % (27391)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.43 % (27391)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.43 % (27391)Termination reason: Refutation
% 0.16/0.43
% 0.16/0.43 % (27391)Memory used [KB]: 6140
% 0.16/0.43 % (27391)Time elapsed: 0.077 s
% 0.16/0.43 % (27391)Instructions burned: 5 (million)
% 0.16/0.43 % (27391)------------------------------
% 0.16/0.43 % (27391)------------------------------
% 0.16/0.43 % (27389)Success in time 0.113 s
%------------------------------------------------------------------------------