TSTP Solution File: SWC147+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC147+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 : n016.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:39:06 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 110 ( 27 equ)
% Maximal formula atoms : 18 ( 7 avg)
% Number of connectives : 127 ( 31 ~; 8 |; 76 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f164,plain,
$false,
inference(subsumption_resolution,[],[f158,f139]) ).
fof(f139,plain,
neq(sK2,nil),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( ssList(sK1)
& ssList(sK3)
& ssList(sK4)
& neq(sK2,nil)
& sK4 = sK2
& sK1 = sK3
& ~ singletonP(sK2)
& ~ neq(sK4,nil)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f104,f118,f117,f116,f115]) ).
fof(f115,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(X1,nil)
& X1 = X3
& X0 = X2
& ~ singletonP(X1)
& ~ neq(X3,nil) ) )
& ssList(X1) ) )
=> ( ssList(sK1)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(X1,nil)
& X1 = X3
& sK1 = X2
& ~ singletonP(X1)
& ~ neq(X3,nil) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(X1,nil)
& X1 = X3
& sK1 = X2
& ~ singletonP(X1)
& ~ neq(X3,nil) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(sK2,nil)
& sK2 = X3
& sK1 = X2
& ~ singletonP(sK2)
& ~ neq(X3,nil) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(sK2,nil)
& sK2 = X3
& sK1 = X2
& ~ singletonP(sK2)
& ~ neq(X3,nil) ) )
=> ( ssList(sK3)
& ? [X3] :
( ssList(X3)
& neq(sK2,nil)
& sK2 = X3
& sK1 = sK3
& ~ singletonP(sK2)
& ~ neq(X3,nil) ) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X3] :
( ssList(X3)
& neq(sK2,nil)
& sK2 = X3
& sK1 = sK3
& ~ singletonP(sK2)
& ~ neq(X3,nil) )
=> ( ssList(sK4)
& neq(sK2,nil)
& sK4 = sK2
& sK1 = sK3
& ~ singletonP(sK2)
& ~ neq(sK4,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& neq(X1,nil)
& X1 = X3
& X0 = X2
& ~ singletonP(X1)
& ~ neq(X3,nil) ) )
& ssList(X1) ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& neq(X1,nil)
& ~ singletonP(X1)
& ~ neq(X3,nil)
& 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)
=> ( X0 != X2
| ~ neq(X1,nil)
| singletonP(X1)
| neq(X3,nil)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ~ neq(X1,nil)
| singletonP(X1)
| neq(X3,nil)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f158,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f135,f138]) ).
fof(f138,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
~ neq(sK4,nil),
inference(cnf_transformation,[],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC147+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n016.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:49:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 % (32329)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.45 % (32329)First to succeed.
% 0.19/0.46 % (32329)Refutation found. Thanks to Tanya!
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.46 % (32329)------------------------------
% 0.19/0.46 % (32329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.46 % (32329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.46 % (32329)Termination reason: Refutation
% 0.19/0.46
% 0.19/0.46 % (32329)Memory used [KB]: 6012
% 0.19/0.46 % (32329)Time elapsed: 0.008 s
% 0.19/0.46 % (32329)Instructions burned: 3 (million)
% 0.19/0.46 % (32329)------------------------------
% 0.19/0.46 % (32329)------------------------------
% 0.19/0.46 % (32308)Success in time 0.107 s
%------------------------------------------------------------------------------