TSTP Solution File: SWC134+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC134+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 : n004.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:41:56 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 138 ( 35 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 154 ( 48 ~; 23 |; 66 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 41 ( 17 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f741,plain,
$false,
inference(avatar_sat_refutation,[],[f600,f736]) ).
fof(f736,plain,
~ spl57_1,
inference(avatar_contradiction_clause,[],[f735]) ).
fof(f735,plain,
( $false
| ~ spl57_1 ),
inference(subsumption_resolution,[],[f718,f366]) ).
fof(f366,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f718,plain,
( ~ cyclefreeP(nil)
| ~ spl57_1 ),
inference(backward_demodulation,[],[f508,f716]) ).
fof(f716,plain,
( nil = sK36
| ~ spl57_1 ),
inference(subsumption_resolution,[],[f711,f555]) ).
fof(f555,plain,
~ neq(sK36,nil),
inference(definition_unfolding,[],[f511,f509]) ).
fof(f509,plain,
sK38 = sK36,
inference(cnf_transformation,[],[f313]) ).
fof(f313,plain,
( sK37 = sK35
& ~ neq(sK38,nil)
& ssList(sK38)
& sK38 = sK36
& ~ cyclefreeP(sK36)
& ssList(sK37)
& ssList(sK36)
& ssList(sK35) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38])],[f127,f312,f311,f310,f309]) ).
fof(f309,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ neq(X3,nil)
& ssList(X3)
& X1 = X3
& ~ cyclefreeP(X1) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK35 = X2
& ~ neq(X3,nil)
& ssList(X3)
& X1 = X3
& ~ cyclefreeP(X1) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f310,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK35 = X2
& ~ neq(X3,nil)
& ssList(X3)
& X1 = X3
& ~ cyclefreeP(X1) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK35 = X2
& ~ neq(X3,nil)
& ssList(X3)
& sK36 = X3
& ~ cyclefreeP(sK36) )
& ssList(X2) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f311,plain,
( ? [X2] :
( ? [X3] :
( sK35 = X2
& ~ neq(X3,nil)
& ssList(X3)
& sK36 = X3
& ~ cyclefreeP(sK36) )
& ssList(X2) )
=> ( ? [X3] :
( sK37 = sK35
& ~ neq(X3,nil)
& ssList(X3)
& sK36 = X3
& ~ cyclefreeP(sK36) )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f312,plain,
( ? [X3] :
( sK37 = sK35
& ~ neq(X3,nil)
& ssList(X3)
& sK36 = X3
& ~ cyclefreeP(sK36) )
=> ( sK37 = sK35
& ~ neq(sK38,nil)
& ssList(sK38)
& sK38 = sK36
& ~ cyclefreeP(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ neq(X3,nil)
& ssList(X3)
& X1 = X3
& ~ cyclefreeP(X1) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f126,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ neq(X3,nil)
& ~ cyclefreeP(X1)
& 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(X3,nil)
| cyclefreeP(X1)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| neq(X3,nil)
| cyclefreeP(X1)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f511,plain,
~ neq(sK38,nil),
inference(cnf_transformation,[],[f313]) ).
fof(f711,plain,
( nil = sK36
| neq(sK36,nil)
| ~ spl57_1 ),
inference(resolution,[],[f620,f594]) ).
fof(f594,plain,
( ssList(nil)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f593]) ).
fof(f593,plain,
( spl57_1
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl57_1])]) ).
fof(f620,plain,
! [X1] :
( ~ ssList(X1)
| sK36 = X1
| neq(sK36,X1) ),
inference(resolution,[],[f542,f506]) ).
fof(f506,plain,
ssList(sK36),
inference(cnf_transformation,[],[f313]) ).
fof(f542,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f336]) ).
fof(f336,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f160]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f508,plain,
~ cyclefreeP(sK36),
inference(cnf_transformation,[],[f313]) ).
fof(f600,plain,
spl57_1,
inference(avatar_split_clause,[],[f490,f593]) ).
fof(f490,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC134+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.13/0.34 % Computer : n004.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:19:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 % (21286)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.47 % (21286)First to succeed.
% 0.19/0.48 % (21311)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.19/0.48 % (21303)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.48 % (21295)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.49 % (21289)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (21305)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.50 % (21286)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (21286)------------------------------
% 0.19/0.50 % (21286)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (21286)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (21286)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (21286)Memory used [KB]: 6012
% 0.19/0.50 % (21286)Time elapsed: 0.095 s
% 0.19/0.50 % (21286)Instructions burned: 19 (million)
% 0.19/0.50 % (21286)------------------------------
% 0.19/0.50 % (21286)------------------------------
% 0.19/0.50 % (21276)Success in time 0.154 s
%------------------------------------------------------------------------------