TSTP Solution File: COM018+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : COM018+1 : TPTP v8.1.0. Released v4.0.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 : n026.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 15:53:47 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 12 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 49 ( 21 ~; 19 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 10 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f155,plain,
$false,
inference(avatar_sat_refutation,[],[f148,f150,f152,f154]) ).
fof(f154,plain,
spl14_3,
inference(avatar_contradiction_clause,[],[f153]) ).
fof(f153,plain,
( $false
| spl14_3 ),
inference(resolution,[],[f147,f113]) ).
fof(f113,plain,
aRewritingSystem0(xR),
inference(cnf_transformation,[],[f15]) ).
fof(f15,axiom,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
fof(f147,plain,
( ~ aRewritingSystem0(xR)
| spl14_3 ),
inference(avatar_component_clause,[],[f145]) ).
fof(f145,plain,
( spl14_3
<=> aRewritingSystem0(xR) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f152,plain,
spl14_2,
inference(avatar_contradiction_clause,[],[f151]) ).
fof(f151,plain,
( $false
| spl14_2 ),
inference(resolution,[],[f143,f96]) ).
fof(f96,plain,
isTerminating0(xR),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
( isLocallyConfluent0(xR)
& isTerminating0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
fof(f143,plain,
( ~ isTerminating0(xR)
| spl14_2 ),
inference(avatar_component_clause,[],[f141]) ).
fof(f141,plain,
( spl14_2
<=> isTerminating0(xR) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f150,plain,
spl14_1,
inference(avatar_contradiction_clause,[],[f149]) ).
fof(f149,plain,
( $false
| spl14_1 ),
inference(resolution,[],[f139,f104]) ).
fof(f104,plain,
aElement0(xw),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
( sdtmndtasgtdt0(xv,xR,xw)
& sdtmndtasgtdt0(xu,xR,xw)
& aElement0(xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
fof(f139,plain,
( ~ aElement0(xw)
| spl14_1 ),
inference(avatar_component_clause,[],[f137]) ).
fof(f137,plain,
( spl14_1
<=> aElement0(xw) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f148,plain,
( ~ spl14_1
| ~ spl14_2
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f129,f145,f141,f137]) ).
fof(f129,plain,
( ~ aRewritingSystem0(xR)
| ~ isTerminating0(xR)
| ~ aElement0(xw) ),
inference(resolution,[],[f95,f115]) ).
fof(f115,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0] : ~ aNormalFormOfIn0(X0,xw,xR),
inference(ennf_transformation,[],[f24]) ).
fof(f24,negated_conjecture,
~ ? [X0] : aNormalFormOfIn0(X0,xw,xR),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
? [X0] : aNormalFormOfIn0(X0,xw,xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f95,plain,
! [X0,X1] :
( aNormalFormOfIn0(sK10(X0,X1),X1,X0)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ~ aRewritingSystem0(X0)
| ~ isTerminating0(X0)
| ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) ) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0] :
( ! [X1] :
( ? [X2] : aNormalFormOfIn0(X2,X1,X0)
| ~ aElement0(X1) )
| ~ isTerminating0(X0)
| ~ aRewritingSystem0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X0] :
( ( isTerminating0(X0)
& aRewritingSystem0(X0) )
=> ! [X1] :
( aElement0(X1)
=> ? [X2] : aNormalFormOfIn0(X2,X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermNF) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : COM018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % 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 : n026.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 : Mon Aug 29 17:20:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 % (11519)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.45 % (11522)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.46 % (11519)First to succeed.
% 0.19/0.47 TRYING [1]
% 0.19/0.47 TRYING [2]
% 0.19/0.47 % (11519)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (11519)------------------------------
% 0.19/0.47 % (11519)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (11519)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (11519)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (11519)Memory used [KB]: 5500
% 0.19/0.47 % (11519)Time elapsed: 0.087 s
% 0.19/0.47 % (11519)Instructions burned: 5 (million)
% 0.19/0.47 % (11519)------------------------------
% 0.19/0.47 % (11519)------------------------------
% 0.19/0.47 % (11515)Success in time 0.129 s
%------------------------------------------------------------------------------