TSTP Solution File: SYN980+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.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 : n006.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 19:46:15 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 2 unt; 0 def)
% Number of atoms : 110 ( 1 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 124 ( 51 ~; 38 |; 18 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 44 ( 35 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f29,f34,f37,f41,f44]) ).
fof(f44,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f42]) ).
fof(f42,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(resolution,[],[f16,f28]) ).
fof(f28,plain,
( ! [X3] : p(f(X3),X3)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_4
<=> ! [X3] : p(f(X3),X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f16,plain,
( ! [X2,X1] : ~ p(X1,X2)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl2_1
<=> ! [X2,X1] : ~ p(X1,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f41,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f39,f38]) ).
fof(f38,plain,
( ~ p(sF1,sK0)
| ~ spl2_2 ),
inference(resolution,[],[f20,f10]) ).
fof(f10,plain,
! [X2,X1] :
( ~ q(X1,X2)
| ~ p(X1,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ! [X1,X2] :
( ~ p(X1,X2)
| ( q(f(sK0),sK0)
& ~ q(X1,X2) ) )
& ! [X3] :
( ( r(sK0)
& ~ r(X3) )
| p(f(X3),X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f6,plain,
( ? [X0] :
( ! [X1,X2] :
( ~ p(X1,X2)
| ( q(f(X0),X0)
& ~ q(X1,X2) ) )
& ! [X3] :
( ( r(X0)
& ~ r(X3) )
| p(f(X3),X3) ) )
=> ( ! [X2,X1] :
( ~ p(X1,X2)
| ( q(f(sK0),sK0)
& ~ q(X1,X2) ) )
& ! [X3] :
( ( r(sK0)
& ~ r(X3) )
| p(f(X3),X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0] :
( ! [X1,X2] :
( ~ p(X1,X2)
| ( q(f(X0),X0)
& ~ q(X1,X2) ) )
& ! [X3] :
( ( r(X0)
& ~ r(X3) )
| p(f(X3),X3) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
? [X0] :
( ! [X2,X3] :
( ~ p(X2,X3)
| ( q(f(X0),X0)
& ~ q(X2,X3) ) )
& ! [X1] :
( ( r(X0)
& ~ r(X1) )
| p(f(X1),X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X3,X2] :
( ( q(f(X0),X0)
=> q(X2,X3) )
& p(X2,X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( p(X2,X1)
& ( q(f(X0),X0)
=> q(X2,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0] :
( ! [X1] :
( ( r(X0)
=> r(X1) )
=> p(f(X1),X1) )
=> ? [X2,X1] :
( p(X2,X1)
& ( q(f(X0),X0)
=> q(X2,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f20,plain,
( q(sF1,sK0)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f18,plain,
( spl2_2
<=> q(sF1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f39,plain,
( p(sF1,sK0)
| ~ spl2_4 ),
inference(superposition,[],[f28,f12]) ).
fof(f12,plain,
sF1 = f(sK0),
introduced(function_definition,[]) ).
fof(f37,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f36]) ).
fof(f36,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(resolution,[],[f16,f31]) ).
fof(f31,plain,
( p(sF1,sK0)
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f30,f25]) ).
fof(f25,plain,
( r(sK0)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl2_3
<=> r(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f30,plain,
( p(sF1,sK0)
| ~ r(sK0) ),
inference(superposition,[],[f8,f12]) ).
fof(f8,plain,
! [X3] :
( p(f(X3),X3)
| ~ r(X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f34,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f33,plain,
( $false
| ~ spl2_2
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f32,f31]) ).
fof(f32,plain,
( ~ p(sF1,sK0)
| ~ spl2_2 ),
inference(resolution,[],[f10,f20]) ).
fof(f29,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f9,f27,f23]) ).
fof(f9,plain,
! [X3] :
( p(f(X3),X3)
| r(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f13,f18,f15]) ).
fof(f13,plain,
! [X2,X1] :
( q(sF1,sK0)
| ~ p(X1,X2) ),
inference(definition_folding,[],[f11,f12]) ).
fof(f11,plain,
! [X2,X1] :
( ~ p(X1,X2)
| q(f(sK0),sK0) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN980+1 : TPTP v8.1.0. Released v3.1.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.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 22:32:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (23811)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.20/0.50 % (23803)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 (3000ds/176Mi)
% 0.20/0.50 % (23796)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.51 % (23796)First to succeed.
% 0.20/0.51 % (23796)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (23796)------------------------------
% 0.20/0.51 % (23796)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (23796)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (23796)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (23796)Memory used [KB]: 5373
% 0.20/0.51 % (23796)Time elapsed: 0.103 s
% 0.20/0.51 % (23796)Instructions burned: 2 (million)
% 0.20/0.51 % (23796)------------------------------
% 0.20/0.51 % (23796)------------------------------
% 0.20/0.51 % (23782)Success in time 0.154 s
%------------------------------------------------------------------------------