TSTP Solution File: SYN343+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN343+1 : TPTP v8.1.0. Released v2.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 : n007.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:37:36 EDT 2022
% Result : Theorem 0.23s 0.52s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 75 ( 31 ~; 19 |; 13 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 3-3 aty)
% Number of variables : 42 ( 30 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f24,plain,
$false,
inference(avatar_sat_refutation,[],[f17,f20,f23]) ).
fof(f23,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f22]) ).
fof(f22,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f21,f13]) ).
fof(f13,plain,
( ! [X2] : ~ big_f(X2,X2)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f12,plain,
( spl1_1
<=> ! [X2] : ~ big_f(X2,X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f21,plain,
( ! [X2,X1] : big_f(X2,X1)
| ~ spl1_1 ),
inference(subsumption_resolution,[],[f9,f13]) ).
fof(f9,plain,
! [X2,X1] :
( big_f(X2,X2)
| big_f(X2,X1) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1,X2] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( ( big_f(X2,X1)
& ~ big_f(sK0(X0,X1,X2),X2) )
| big_f(X2,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f6,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( ( big_f(X2,X1)
& ~ big_f(X3,X2) )
| big_f(X2,X2) ) )
=> ( ( ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( ( big_f(X2,X1)
& ~ big_f(sK0(X0,X1,X2),X2) )
| big_f(X2,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X0,X1,X2] :
? [X3] :
( ( ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( ( big_f(X2,X1)
& ~ big_f(X3,X2) )
| big_f(X2,X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
! [X0,X2,X1] :
? [X3] :
( ( ~ big_f(X2,X0)
| ~ big_f(X1,X1) )
& ( ( big_f(X1,X2)
& ~ big_f(X3,X1) )
| big_f(X1,X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ? [X2,X0,X1] :
! [X3] :
( ( ( big_f(X1,X2)
=> big_f(X3,X1) )
=> big_f(X1,X1) )
=> ( big_f(X1,X1)
& big_f(X2,X0) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X2,X0,X1] :
! [X3] :
( ( ( big_f(X0,X1)
=> big_f(X3,X0) )
=> big_f(X0,X0) )
=> ( big_f(X0,X0)
& big_f(X1,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X2,X0,X1] :
! [X3] :
( ( ( big_f(X0,X1)
=> big_f(X3,X0) )
=> big_f(X0,X0) )
=> ( big_f(X0,X0)
& big_f(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_16_2) ).
fof(f20,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f19]) ).
fof(f19,plain,
( $false
| ~ spl1_2 ),
inference(subsumption_resolution,[],[f18,f16]) ).
fof(f16,plain,
( ! [X0,X1] : ~ big_f(X1,X0)
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl1_2
<=> ! [X0,X1] : ~ big_f(X1,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f18,plain,
( ! [X2,X1] : big_f(X2,X1)
| ~ spl1_2 ),
inference(subsumption_resolution,[],[f9,f16]) ).
fof(f17,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f10,f15,f12]) ).
fof(f10,plain,
! [X2,X0,X1] :
( ~ big_f(X1,X0)
| ~ big_f(X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : SYN343+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.15/0.38 % Computer : n007.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Tue Aug 30 21:31:31 EDT 2022
% 0.15/0.38 % CPUTime :
% 0.23/0.52 % (20243)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.23/0.52 % (20243)First to succeed.
% 0.23/0.52 % (20243)Refutation found. Thanks to Tanya!
% 0.23/0.52 % SZS status Theorem for theBenchmark
% 0.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.52 % (20243)------------------------------
% 0.23/0.52 % (20243)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.23/0.52 % (20243)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.23/0.52 % (20243)Termination reason: Refutation
% 0.23/0.52
% 0.23/0.52 % (20243)Memory used [KB]: 5373
% 0.23/0.52 % (20243)Time elapsed: 0.092 s
% 0.23/0.52 % (20243)Instructions burned: 1 (million)
% 0.23/0.52 % (20243)------------------------------
% 0.23/0.52 % (20243)------------------------------
% 0.23/0.52 % (20235)Success in time 0.138 s
%------------------------------------------------------------------------------