TSTP Solution File: CAT006-3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : CAT006-3 : TPTP v8.1.0. Released v1.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 : n027.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:51:15 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 55 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 43 ( 20 ~; 19 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f117,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f54,f99,f101,f116]) ).
fof(f116,plain,
~ spl0_4,
inference(avatar_contradiction_clause,[],[f115]) ).
fof(f115,plain,
( $false
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f110]) ).
fof(f110,plain,
( d != d
| ~ spl0_4 ),
inference(superposition,[],[f21,f94]) ).
fof(f94,plain,
( d = codomain(a)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f92]) ).
fof(f92,plain,
( spl0_4
<=> d = codomain(a) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f21,axiom,
d != codomain(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_is_d) ).
fof(f101,plain,
spl0_5,
inference(avatar_contradiction_clause,[],[f100]) ).
fof(f100,plain,
( $false
| spl0_5 ),
inference(resolution,[],[f98,f55]) ).
fof(f55,plain,
there_exists(a),
inference(backward_demodulation,[],[f18,f48]) ).
fof(f48,plain,
a = compose(d,a),
inference(resolution,[],[f20,f18]) ).
fof(f20,axiom,
! [X0] :
( ~ there_exists(compose(d,X0))
| compose(d,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dx_equals_x) ).
fof(f18,axiom,
there_exists(compose(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',da_exists) ).
fof(f98,plain,
( ~ there_exists(a)
| spl0_5 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f96,plain,
( spl0_5
<=> there_exists(a) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f99,plain,
( spl0_4
| ~ spl0_5
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f90,f51,f96,f92]) ).
fof(f51,plain,
( spl0_3
<=> d = domain(d) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f90,plain,
( ~ there_exists(a)
| d = codomain(a)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f85,f53]) ).
fof(f53,plain,
( d = domain(d)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f85,plain,
( ~ there_exists(a)
| codomain(a) = domain(d) ),
inference(superposition,[],[f7,f48]) ).
fof(f7,axiom,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| domain(X0) = codomain(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).
fof(f54,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f49,f41,f51]) ).
fof(f41,plain,
( spl0_2
<=> there_exists(d) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f49,plain,
( ~ there_exists(d)
| d = domain(d) ),
inference(superposition,[],[f20,f10]) ).
fof(f10,axiom,
! [X0] : compose(X0,domain(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_domain) ).
fof(f46,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f45]) ).
fof(f45,plain,
( $false
| spl0_2 ),
inference(resolution,[],[f43,f31]) ).
fof(f31,plain,
there_exists(d),
inference(resolution,[],[f28,f4]) ).
fof(f4,axiom,
! [X0] :
( ~ there_exists(domain(X0))
| there_exists(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).
fof(f28,plain,
there_exists(domain(d)),
inference(resolution,[],[f6,f18]) ).
fof(f6,axiom,
! [X0,X1] :
( ~ there_exists(compose(X0,X1))
| there_exists(domain(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composition_implies_domain) ).
fof(f43,plain,
( ~ there_exists(d)
| spl0_2 ),
inference(avatar_component_clause,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CAT006-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 29 16:32:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (1260)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.49 % (1260)First to succeed.
% 0.20/0.49 % (1260)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (1260)------------------------------
% 0.20/0.49 % (1260)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (1260)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (1260)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (1260)Memory used [KB]: 5500
% 0.20/0.49 % (1260)Time elapsed: 0.082 s
% 0.20/0.49 % (1260)Instructions burned: 4 (million)
% 0.20/0.49 % (1260)------------------------------
% 0.20/0.49 % (1260)------------------------------
% 0.20/0.49 % (1249)Success in time 0.145 s
%------------------------------------------------------------------------------