TSTP Solution File: SYN321+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --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:26:11 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 86 ( 28 ~; 24 |; 16 &)
% ( 3 <=>; 13 =>; 0 <=; 2 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 73 ( 60 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,plain,
$false,
inference(unit_resulting_resolution,[],[f17,f15,f13]) ).
fof(f13,plain,
! [X0,X1] :
( ~ big_g(X1,sK0(X1))
| ~ big_f(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ( ! [X2] : big_g(X1,X2)
| ! [X3] : ~ big_f(X1,X3) )
& ( ~ big_g(X1,sK0(X1))
| ~ big_f(X1,X0) )
& ( ! [X5] : big_g(X1,X5)
| big_f(X1,X0) )
& ! [X6] :
( big_f(X6,X0)
| ~ big_g(X6,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9]) ).
fof(f9,plain,
! [X1] :
( ? [X4] : ~ big_g(X1,X4)
=> ~ big_g(X1,sK0(X1)) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X0,X1] :
( ( ! [X2] : big_g(X1,X2)
| ! [X3] : ~ big_f(X1,X3) )
& ( ? [X4] : ~ big_g(X1,X4)
| ~ big_f(X1,X0) )
& ( ! [X5] : big_g(X1,X5)
| big_f(X1,X0) )
& ! [X6] :
( big_f(X6,X0)
| ~ big_g(X6,X6) ) ),
inference(rectify,[],[f7]) ).
fof(f7,plain,
! [X0,X1] :
( ( ! [X3] : big_g(X1,X3)
| ! [X2] : ~ big_f(X1,X2) )
& ( ? [X5] : ~ big_g(X1,X5)
| ~ big_f(X1,X0) )
& ( ! [X5] : big_g(X1,X5)
| big_f(X1,X0) )
& ! [X4] :
( big_f(X4,X0)
| ~ big_g(X4,X4) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( ( ! [X3] : big_g(X1,X3)
| ! [X2] : ~ big_f(X1,X2) )
& ( ? [X5] : ~ big_g(X1,X5)
| ~ big_f(X1,X0) )
& ( ! [X5] : big_g(X1,X5)
| big_f(X1,X0) )
& ! [X4] :
( big_f(X4,X0)
| ~ big_g(X4,X4) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X0,X1] :
( ( ! [X3] : big_g(X1,X3)
| ! [X2] : ~ big_f(X1,X2) )
& ( big_f(X1,X0)
<~> ! [X5] : big_g(X1,X5) )
& ! [X4] :
( big_f(X4,X0)
| ~ big_g(X4,X4) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X0,X1] :
( ( big_f(X1,X0)
<~> ! [X5] : big_g(X1,X5) )
& ! [X4] :
( big_f(X4,X0)
| ~ big_g(X4,X4) )
& ( ! [X3] : big_g(X1,X3)
| ! [X2] : ~ big_f(X1,X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ? [X0,X1] :
( ( ? [X2] : big_f(X1,X2)
=> ! [X3] : big_g(X1,X3) )
=> ( ! [X4] :
( big_g(X4,X4)
=> big_f(X4,X0) )
=> ( big_f(X1,X0)
<=> ! [X5] : big_g(X1,X5) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X1,X0] :
( ( ? [X2] : big_f(X0,X2)
=> ! [X2] : big_g(X0,X2) )
=> ( ! [X2] :
( big_g(X2,X2)
=> big_f(X2,X1) )
=> ( big_f(X0,X1)
<=> ! [X2] : big_g(X0,X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X1,X0] :
( ( ? [X2] : big_f(X0,X2)
=> ! [X2] : big_g(X0,X2) )
=> ( ! [X2] :
( big_g(X2,X2)
=> big_f(X2,X1) )
=> ( big_f(X0,X1)
<=> ! [X2] : big_g(X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_3_2) ).
fof(f15,plain,
! [X2,X1] : big_g(X1,X2),
inference(subsumption_resolution,[],[f14,f12]) ).
fof(f12,plain,
! [X0,X1,X5] :
( big_g(X1,X5)
| big_f(X1,X0) ),
inference(cnf_transformation,[],[f10]) ).
fof(f14,plain,
! [X2,X3,X1] :
( big_g(X1,X2)
| ~ big_f(X1,X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f17,plain,
! [X0,X1] : big_f(X0,X1),
inference(resolution,[],[f11,f15]) ).
fof(f11,plain,
! [X0,X6] :
( ~ big_g(X6,X6)
| big_f(X6,X0) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN321+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n006.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:43:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 % (11294)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.18/0.47 % (11302)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.47 % (11294)First to succeed.
% 0.18/0.48 % (11294)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (11294)------------------------------
% 0.18/0.48 % (11294)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (11294)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (11294)Termination reason: Refutation
% 0.18/0.48
% 0.18/0.48 % (11294)Memory used [KB]: 5884
% 0.18/0.48 % (11294)Time elapsed: 0.089 s
% 0.18/0.48 % (11294)Instructions burned: 2 (million)
% 0.18/0.48 % (11294)------------------------------
% 0.18/0.48 % (11294)------------------------------
% 0.18/0.48 % (11286)Success in time 0.138 s
%------------------------------------------------------------------------------