TSTP Solution File: SYN354+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN354+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 : 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 19:37:40 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 3 unt; 0 def)
% Number of atoms : 230 ( 0 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 300 ( 103 ~; 103 |; 62 &)
% ( 10 <=>; 20 =>; 0 <=; 2 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 42 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f63,plain,
$false,
inference(avatar_sat_refutation,[],[f27,f59,f61]) ).
fof(f61,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f60]) ).
fof(f60,plain,
( $false
| ~ spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f22,f26]) ).
fof(f26,plain,
( ! [X0] : ~ big_f(sK0,X0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl3_2
<=> ! [X0] : ~ big_f(sK0,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f22,plain,
( big_f(sK0,sK0)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_1
<=> big_f(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f59,plain,
spl3_1,
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f58,plain,
( $false
| spl3_1 ),
inference(resolution,[],[f57,f15]) ).
fof(f15,plain,
big_f(sK1,sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X2,X3] :
( ( ~ big_f(sK0,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK1,X2) )
& ( big_g(sK0,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& big_f(sK1,sK0)
& big_g(sK1,sK0)
& ( ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK0,sK2(X2,X3)) ) )
| big_f(sK0,X3)
| ~ big_f(X2,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9]) ).
fof(f9,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X0,X2)
| ~ big_f(X2,X3)
| ~ big_f(X1,X2) )
& ( big_g(X0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X0,X4) )
& big_f(X1,X0)
& big_g(X1,X0)
& ( ( ( ~ big_g(X3,X4)
| ~ big_g(X0,X4) )
& ( big_g(X3,X4)
| big_g(X0,X4) ) )
| big_f(X0,X3)
| ~ big_f(X2,X3) ) )
=> ! [X3,X2] :
? [X4] :
( ( ~ big_f(sK0,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK1,X2) )
& ( big_g(sK0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK0,X4) )
& big_f(sK1,sK0)
& big_g(sK1,sK0)
& ( ( ( ~ big_g(X3,X4)
| ~ big_g(sK0,X4) )
& ( big_g(X3,X4)
| big_g(sK0,X4) ) )
| big_f(sK0,X3)
| ~ big_f(X2,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X2,X3] :
( ? [X4] :
( ( ~ big_f(sK0,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK1,X2) )
& ( big_g(sK0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(sK0,X4) )
& big_f(sK1,sK0)
& big_g(sK1,sK0)
& ( ( ( ~ big_g(X3,X4)
| ~ big_g(sK0,X4) )
& ( big_g(X3,X4)
| big_g(sK0,X4) ) )
| big_f(sK0,X3)
| ~ big_f(X2,X3) ) )
=> ( ( ~ big_f(sK0,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK1,X2) )
& ( big_g(sK0,sK2(X2,X3))
| ~ big_g(X2,sK2(X2,X3)) )
& ( big_g(X2,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& big_f(sK1,sK0)
& big_g(sK1,sK0)
& ( ( ( ~ big_g(X3,sK2(X2,X3))
| ~ big_g(sK0,sK2(X2,X3)) )
& ( big_g(X3,sK2(X2,X3))
| big_g(sK0,sK2(X2,X3)) ) )
| big_f(sK0,X3)
| ~ big_f(X2,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X0,X2)
| ~ big_f(X2,X3)
| ~ big_f(X1,X2) )
& ( big_g(X0,X4)
| ~ big_g(X2,X4) )
& ( big_g(X2,X4)
| ~ big_g(X0,X4) )
& big_f(X1,X0)
& big_g(X1,X0)
& ( ( ( ~ big_g(X3,X4)
| ~ big_g(X0,X4) )
& ( big_g(X3,X4)
| big_g(X0,X4) ) )
| big_f(X0,X3)
| ~ big_f(X2,X3) ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X1,X3)
| ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_g(X1,X4)
| ~ big_g(X3,X4) )
& ( big_g(X3,X4)
| ~ big_g(X1,X4) )
& big_f(X0,X1)
& big_g(X0,X1)
& ( ( ( ~ big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_g(X2,X4)
| big_g(X1,X4) ) )
| big_f(X1,X2)
| ~ big_f(X3,X2) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X1,X3)
| ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_g(X1,X4)
| ~ big_g(X3,X4) )
& ( big_g(X3,X4)
| ~ big_g(X1,X4) )
& big_f(X0,X1)
& big_g(X0,X1)
& ( ( ( ~ big_g(X2,X4)
| ~ big_g(X1,X4) )
& ( big_g(X2,X4)
| big_g(X1,X4) ) )
| big_f(X1,X2)
| ~ big_f(X3,X2) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X1,X3)
| ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_g(X1,X4)
<=> big_g(X3,X4) )
& big_f(X0,X1)
& big_g(X0,X1)
& ( ( big_g(X1,X4)
<~> big_g(X2,X4) )
| big_f(X1,X2)
| ~ big_f(X3,X2) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
! [X3,X2] :
? [X4] :
( ( ~ big_f(X1,X3)
| ~ big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_g(X1,X4)
<=> big_g(X3,X4) )
& ( big_f(X1,X2)
| ~ big_f(X3,X2)
| ( big_g(X1,X4)
<~> big_g(X2,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X1,X0] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X3,X2)
=> big_f(X1,X2) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X0,X3)
& big_f(X1,X3)
& big_f(X3,X2) ) ) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X3,X4)
<=> big_g(X1,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X3,X2] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X3,X4)
<=> big_g(X1,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_20_1) ).
fof(f57,plain,
( ! [X2] : ~ big_f(X2,sK0)
| spl3_1 ),
inference(subsumption_resolution,[],[f56,f34]) ).
fof(f34,plain,
( ! [X0] :
( big_g(sK0,sK2(X0,sK0))
| ~ big_f(X0,sK0) )
| spl3_1 ),
inference(subsumption_resolution,[],[f32,f23]) ).
fof(f23,plain,
( ~ big_f(sK0,sK0)
| spl3_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f32,plain,
! [X0] :
( ~ big_f(X0,sK0)
| big_g(sK0,sK2(X0,sK0))
| big_f(sK0,sK0) ),
inference(factoring,[],[f12]) ).
fof(f12,plain,
! [X2,X3] :
( big_g(sK0,sK2(X2,X3))
| big_g(X3,sK2(X2,X3))
| big_f(sK0,X3)
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f11]) ).
fof(f56,plain,
( ! [X2] :
( ~ big_f(X2,sK0)
| ~ big_g(sK0,sK2(X2,sK0)) )
| spl3_1 ),
inference(subsumption_resolution,[],[f52,f23]) ).
fof(f52,plain,
( ! [X2] :
( ~ big_f(X2,sK0)
| big_f(sK0,sK0)
| ~ big_g(sK0,sK2(X2,sK0)) )
| spl3_1 ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f44,plain,
( ! [X2] :
( big_f(sK0,sK0)
| ~ big_g(sK0,sK2(X2,sK0))
| ~ big_f(X2,sK0)
| ~ big_f(X2,sK0) )
| spl3_1 ),
inference(resolution,[],[f13,f34]) ).
fof(f13,plain,
! [X2,X3] :
( ~ big_g(sK0,sK2(X2,X3))
| big_f(sK0,X3)
| ~ big_g(X3,sK2(X2,X3))
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f11]) ).
fof(f27,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f19,f25,f21]) ).
fof(f19,plain,
! [X0] :
( ~ big_f(sK0,X0)
| ~ big_f(sK0,sK0) ),
inference(resolution,[],[f18,f15]) ).
fof(f18,plain,
! [X2,X3] :
( ~ big_f(sK1,X2)
| ~ big_f(X2,X3)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN354+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/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 : n004.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 : Tue Aug 30 21:44:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.48 % (7234)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.19/0.48 % (7218)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.48 % (7218)First to succeed.
% 0.19/0.48 % (7218)Refutation found. Thanks to Tanya!
% 0.19/0.48 % SZS status Theorem for theBenchmark
% 0.19/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48 % (7218)------------------------------
% 0.19/0.48 % (7218)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48 % (7218)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48 % (7218)Termination reason: Refutation
% 0.19/0.48
% 0.19/0.48 % (7218)Memory used [KB]: 5373
% 0.19/0.48 % (7218)Time elapsed: 0.100 s
% 0.19/0.48 % (7218)Instructions burned: 3 (million)
% 0.19/0.49 % (7218)------------------------------
% 0.19/0.49 % (7218)------------------------------
% 0.19/0.49 % (7205)Success in time 0.145 s
%------------------------------------------------------------------------------