TSTP Solution File: SWC391+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC391+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 : n003.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:54 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 133 ( 43 equ)
% Maximal formula atoms : 20 ( 7 avg)
% Number of connectives : 139 ( 25 ~; 8 |; 91 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 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 : 45 ( 10 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f202,plain,
$false,
inference(subsumption_resolution,[],[f160,f200]) ).
fof(f200,plain,
~ memberP(sK0,sK4),
inference(forward_demodulation,[],[f191,f190]) ).
fof(f190,plain,
sK3 = sK0,
inference(definition_unfolding,[],[f162,f163]) ).
fof(f163,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
( ssList(sK0)
& ssList(sK1)
& sK1 = sK3
& ssList(sK3)
& sK2 = sK3
& sK2 = sK0
& ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f105,f128,f127,f126,f125,f124]) ).
fof(f124,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X2 = X3
& X0 = X2
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) ) )
& ssList(X2) ) ) )
=> ( ssList(sK0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X2 = X3
& sK0 = X2
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X2 = X3
& sK0 = X2
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
& ssList(X2) ) )
=> ( ssList(sK1)
& ? [X2] :
( ? [X3] :
( sK1 = X3
& ssList(X3)
& X2 = X3
& sK0 = X2
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X2] :
( ? [X3] :
( sK1 = X3
& ssList(X3)
& X2 = X3
& sK0 = X2
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK1 = X3
& ssList(X3)
& sK2 = X3
& sK2 = sK0
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X3] :
( sK1 = X3
& ssList(X3)
& sK2 = X3
& sK2 = sK0
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) )
=> ( sK1 = sK3
& ssList(sK3)
& sK2 = sK3
& sK2 = sK0
& ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
=> ( ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& X2 = X3
& X0 = X2
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) ) )
& ssList(X2) ) ) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X2 = X3
& X1 = X3
& X0 = X2
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& 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)
=> ( X2 != X3
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X2 != X3
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f162,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f129]) ).
fof(f191,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f161,f165]) ).
fof(f165,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f161,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f129]) ).
fof(f160,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC391+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.12/0.35 % Computer : n003.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 30 18:53:23 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.53 % (14847)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.20/0.53 % (14846)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.20/0.53 % (14847)First to succeed.
% 0.20/0.53 % (14854)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.20/0.54 % (14854)Instruction limit reached!
% 0.20/0.54 % (14854)------------------------------
% 0.20/0.54 % (14854)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (14854)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (14854)Termination reason: Unknown
% 0.20/0.54 % (14854)Termination phase: Naming
% 0.20/0.54
% 0.20/0.54 % (14854)Memory used [KB]: 1535
% 0.20/0.54 % (14854)Time elapsed: 0.002 s
% 0.20/0.54 % (14854)Instructions burned: 3 (million)
% 0.20/0.54 % (14854)------------------------------
% 0.20/0.54 % (14854)------------------------------
% 0.20/0.54 % (14847)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (14847)------------------------------
% 0.20/0.54 % (14847)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (14847)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (14847)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (14847)Memory used [KB]: 6140
% 0.20/0.54 % (14847)Time elapsed: 0.005 s
% 0.20/0.54 % (14847)Instructions burned: 4 (million)
% 0.20/0.54 % (14847)------------------------------
% 0.20/0.54 % (14847)------------------------------
% 0.20/0.54 % (14839)Success in time 0.179 s
%------------------------------------------------------------------------------