TSTP Solution File: SYN321+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN321+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 : n025.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:29 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 100 ( 35 ~; 29 |; 16 &)
% ( 5 <=>; 13 =>; 0 <=; 2 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 90 ( 77 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,plain,
$false,
inference(subsumption_resolution,[],[f27,f23]) ).
fof(f23,plain,
! [X2,X3] : big_f(X2,X3),
inference(subsumption_resolution,[],[f21,f16]) ).
fof(f16,plain,
! [X0,X1] :
( big_f(X1,X0)
| ~ sP1(X1) ),
inference(general_splitting,[],[f13,f15_D]) ).
fof(f15,plain,
! [X3,X1] :
( big_g(X1,X3)
| sP1(X1) ),
inference(cnf_transformation,[],[f15_D]) ).
fof(f15_D,plain,
! [X1] :
( ! [X3] : big_g(X1,X3)
<=> ~ sP1(X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP1])]) ).
fof(f13,plain,
! [X3,X0,X1] :
( big_g(X1,X3)
| big_f(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ( ~ big_g(X1,sK0(X1))
| ~ big_f(X1,X0) )
& ( ! [X3] : big_g(X1,X3)
| big_f(X1,X0) )
& ( ! [X4] : big_g(X1,X4)
| ! [X5] : ~ big_f(X1,X5) )
& ! [X6] :
( ~ big_g(X6,X6)
| big_f(X6,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
fof(f9,plain,
! [X1] :
( ? [X2] : ~ big_g(X1,X2)
=> ~ big_g(X1,sK0(X1)) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
( ( ? [X2] : ~ big_g(X1,X2)
| ~ big_f(X1,X0) )
& ( ! [X3] : big_g(X1,X3)
| big_f(X1,X0) )
& ( ! [X4] : big_g(X1,X4)
| ! [X5] : ~ big_f(X1,X5) )
& ! [X6] :
( ~ big_g(X6,X6)
| big_f(X6,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
! [X1,X0] :
( ( ? [X5] : ~ big_g(X0,X5)
| ~ big_f(X0,X1) )
& ( ! [X5] : big_g(X0,X5)
| big_f(X0,X1) )
& ( ! [X3] : big_g(X0,X3)
| ! [X2] : ~ big_f(X0,X2) )
& ! [X4] :
( ~ big_g(X4,X4)
| big_f(X4,X1) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
! [X1,X0] :
( ( ? [X5] : ~ big_g(X0,X5)
| ~ big_f(X0,X1) )
& ( ! [X5] : big_g(X0,X5)
| big_f(X0,X1) )
& ( ! [X3] : big_g(X0,X3)
| ! [X2] : ~ big_f(X0,X2) )
& ! [X4] :
( ~ big_g(X4,X4)
| big_f(X4,X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1,X0] :
( ( big_f(X0,X1)
<~> ! [X5] : big_g(X0,X5) )
& ( ! [X3] : big_g(X0,X3)
| ! [X2] : ~ big_f(X0,X2) )
& ! [X4] :
( ~ big_g(X4,X4)
| big_f(X4,X1) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X1,X0] :
( ( big_f(X0,X1)
<~> ! [X5] : big_g(X0,X5) )
& ! [X4] :
( ~ big_g(X4,X4)
| big_f(X4,X1) )
& ( ! [X3] : big_g(X0,X3)
| ! [X2] : ~ big_f(X0,X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ? [X1,X0] :
( ( ? [X2] : big_f(X0,X2)
=> ! [X3] : big_g(X0,X3) )
=> ( ! [X4] :
( big_g(X4,X4)
=> big_f(X4,X1) )
=> ( ! [X5] : big_g(X0,X5)
<=> big_f(X0,X1) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
( ( ? [X2] : big_f(X0,X2)
=> ! [X2] : big_g(X0,X2) )
=> ( ! [X2] :
( big_g(X2,X2)
=> big_f(X2,X1) )
=> ( ! [X2] : big_g(X0,X2)
<=> big_f(X0,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0,X1] :
( ( ? [X2] : big_f(X0,X2)
=> ! [X2] : big_g(X0,X2) )
=> ( ! [X2] :
( big_g(X2,X2)
=> big_f(X2,X1) )
=> ( ! [X2] : big_g(X0,X2)
<=> big_f(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_3_2) ).
fof(f21,plain,
! [X2,X3] :
( sP1(X2)
| big_f(X2,X3) ),
inference(resolution,[],[f11,f15]) ).
fof(f11,plain,
! [X0,X6] :
( ~ big_g(X6,X6)
| big_f(X6,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f27,plain,
! [X0,X1] : ~ big_f(X1,X0),
inference(subsumption_resolution,[],[f14,f25]) ).
fof(f25,plain,
! [X1,X4] : big_g(X1,X4),
inference(subsumption_resolution,[],[f17,f24]) ).
fof(f24,plain,
! [X1] : ~ sP2(X1),
inference(subsumption_resolution,[],[f18,f23]) ).
fof(f18,plain,
! [X1,X5] :
( ~ big_f(X1,X5)
| ~ sP2(X1) ),
inference(general_splitting,[],[f12,f17_D]) ).
fof(f12,plain,
! [X1,X4,X5] :
( big_g(X1,X4)
| ~ big_f(X1,X5) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X1,X4] :
( big_g(X1,X4)
| sP2(X1) ),
inference(cnf_transformation,[],[f17_D]) ).
fof(f17_D,plain,
! [X1] :
( ! [X4] : big_g(X1,X4)
<=> ~ sP2(X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP2])]) ).
fof(f14,plain,
! [X0,X1] :
( ~ big_g(X1,sK0(X1))
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN321+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 30 21:53:15 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.20/0.48 % (30935)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.20/0.48 % (30935)First to succeed.
% 0.20/0.49 % (30934)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.49 % (30953)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.49 % (30935)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (30935)------------------------------
% 0.20/0.49 % (30935)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (30935)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (30935)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (30935)Memory used [KB]: 5373
% 0.20/0.49 % (30935)Time elapsed: 0.086 s
% 0.20/0.49 % (30935)Instructions burned: 1 (million)
% 0.20/0.49 % (30935)------------------------------
% 0.20/0.49 % (30935)------------------------------
% 0.20/0.49 % (30926)Success in time 0.147 s
%------------------------------------------------------------------------------