TSTP Solution File: SYN059+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN059+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 : n001.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:25:22 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 12 unt; 0 def)
% Number of atoms : 237 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 293 ( 116 ~; 105 |; 51 &)
% ( 4 <=>; 14 =>; 0 <=; 3 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 81 ( 62 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f74,plain,
$false,
inference(resolution,[],[f68,f61]) ).
fof(f61,plain,
big_f(sK2),
inference(resolution,[],[f60,f37]) ).
fof(f37,plain,
big_f(sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
big_f(sK6),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f1,f23]) ).
fof(f23,plain,
( ? [X0] : big_f(X0)
=> big_f(sK6) ),
introduced(choice_axiom,[]) ).
fof(f1,axiom,
? [X0] : big_f(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29_1) ).
fof(f60,plain,
! [X0] :
( ~ big_f(X0)
| big_f(sK2) ),
inference(subsumption_resolution,[],[f53,f57]) ).
fof(f57,plain,
big_g(sK1),
inference(resolution,[],[f55,f36]) ).
fof(f36,plain,
big_g(sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
big_g(sK5),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f6,f21]) ).
fof(f21,plain,
( ? [X0] : big_g(X0)
=> big_g(sK5) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] : big_g(X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
? [X1] : big_g(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29_2) ).
fof(f55,plain,
! [X0] :
( ~ big_g(X0)
| big_g(sK1) ),
inference(subsumption_resolution,[],[f44,f48]) ).
fof(f48,plain,
~ sP0,
inference(subsumption_resolution,[],[f47,f34]) ).
fof(f34,plain,
( big_f(sK3)
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( ~ sP0
| ( big_g(sK4)
& big_f(sK3)
& ( ~ big_h(sK3)
| ~ big_j(sK4) ) ) )
& ( sP0
| ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_h(X2)
& big_j(X3) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f18,f19]) ).
fof(f19,plain,
( ? [X0,X1] :
( big_g(X1)
& big_f(X0)
& ( ~ big_h(X0)
| ~ big_j(X1) ) )
=> ( big_g(sK4)
& big_f(sK3)
& ( ~ big_h(sK3)
| ~ big_j(sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ( ~ sP0
| ? [X0,X1] :
( big_g(X1)
& big_f(X0)
& ( ~ big_h(X0)
| ~ big_j(X1) ) ) )
& ( sP0
| ! [X2,X3] :
( ~ big_g(X3)
| ~ big_f(X2)
| ( big_h(X2)
& big_j(X3) ) ) ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
( ( ~ sP0
| ? [X1,X0] :
( big_g(X0)
& big_f(X1)
& ( ~ big_h(X1)
| ~ big_j(X0) ) ) )
& ( sP0
| ! [X1,X0] :
( ~ big_g(X0)
| ~ big_f(X1)
| ( big_h(X1)
& big_j(X0) ) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
( ! [X1,X0] :
( ~ big_g(X0)
| ~ big_f(X1)
| ( big_h(X1)
& big_j(X0) ) )
<~> sP0 ),
inference(definition_folding,[],[f8,f9]) ).
fof(f9,plain,
( sP0
<=> ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( big_h(X2)
| ~ big_f(X2) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f8,plain,
( ! [X1,X0] :
( ~ big_g(X0)
| ~ big_f(X1)
| ( big_h(X1)
& big_j(X0) ) )
<~> ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( big_h(X2)
| ~ big_f(X2) ) ) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
( ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( big_h(X2)
| ~ big_f(X2) ) )
<~> ! [X0,X1] :
( ( big_h(X1)
& big_j(X0) )
| ~ big_f(X1)
| ~ big_g(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
~ ( ( ! [X2] :
( big_f(X2)
=> big_h(X2) )
& ! [X3] :
( big_g(X3)
=> big_j(X3) ) )
<=> ! [X0,X1] :
( ( big_f(X1)
& big_g(X0) )
=> ( big_h(X1)
& big_j(X0) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ( ! [X1,X3] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_h(X3)
& big_j(X1) ) )
<=> ( ! [X0] :
( big_f(X0)
=> big_h(X0) )
& ! [X2] :
( big_g(X2)
=> big_j(X2) ) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
( ! [X1,X3] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_h(X3)
& big_j(X1) ) )
<=> ( ! [X0] :
( big_f(X0)
=> big_h(X0) )
& ! [X2] :
( big_g(X2)
=> big_j(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel29) ).
fof(f47,plain,
( ~ big_f(sK3)
| ~ sP0 ),
inference(duplicate_literal_removal,[],[f46]) ).
fof(f46,plain,
( ~ sP0
| ~ sP0
| ~ big_f(sK3) ),
inference(resolution,[],[f42,f25]) ).
fof(f25,plain,
! [X3] :
( big_h(X3)
| ~ big_f(X3)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
( ( sP0
| ( big_g(sK1)
& ~ big_j(sK1) )
| ( ~ big_h(sK2)
& big_f(sK2) ) )
& ( ( ! [X2] :
( ~ big_g(X2)
| big_j(X2) )
& ! [X3] :
( big_h(X3)
| ~ big_f(X3) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f13,f15,f14]) ).
fof(f14,plain,
( ? [X0] :
( big_g(X0)
& ~ big_j(X0) )
=> ( big_g(sK1)
& ~ big_j(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X1] :
( ~ big_h(X1)
& big_f(X1) )
=> ( ~ big_h(sK2)
& big_f(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ( sP0
| ? [X0] :
( big_g(X0)
& ~ big_j(X0) )
| ? [X1] :
( ~ big_h(X1)
& big_f(X1) ) )
& ( ( ! [X2] :
( ~ big_g(X2)
| big_j(X2) )
& ! [X3] :
( big_h(X3)
| ~ big_f(X3) ) )
| ~ sP0 ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
( ( sP0
| ? [X3] :
( big_g(X3)
& ~ big_j(X3) )
| ? [X2] :
( ~ big_h(X2)
& big_f(X2) ) )
& ( ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( big_h(X2)
| ~ big_f(X2) ) )
| ~ sP0 ) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
( ( sP0
| ? [X3] :
( big_g(X3)
& ~ big_j(X3) )
| ? [X2] :
( ~ big_h(X2)
& big_f(X2) ) )
& ( ( ! [X3] :
( ~ big_g(X3)
| big_j(X3) )
& ! [X2] :
( big_h(X2)
| ~ big_f(X2) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f42,plain,
( ~ big_h(sK3)
| ~ sP0 ),
inference(subsumption_resolution,[],[f41,f35]) ).
fof(f35,plain,
( big_g(sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f41,plain,
( ~ big_h(sK3)
| ~ big_g(sK4)
| ~ sP0 ),
inference(duplicate_literal_removal,[],[f40]) ).
fof(f40,plain,
( ~ sP0
| ~ sP0
| ~ big_h(sK3)
| ~ big_g(sK4) ),
inference(resolution,[],[f33,f26]) ).
fof(f26,plain,
! [X2] :
( big_j(X2)
| ~ big_g(X2)
| ~ sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f33,plain,
( ~ big_j(sK4)
| ~ sP0
| ~ big_h(sK3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f44,plain,
! [X0] :
( big_g(sK1)
| ~ big_g(X0)
| sP0 ),
inference(subsumption_resolution,[],[f43,f29]) ).
fof(f29,plain,
( big_g(sK1)
| big_f(sK2)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
! [X0] :
( big_g(sK1)
| sP0
| ~ big_g(X0)
| ~ big_f(sK2) ),
inference(resolution,[],[f38,f30]) ).
fof(f30,plain,
( ~ big_h(sK2)
| sP0
| big_g(sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f38,plain,
! [X2,X3] :
( big_h(X2)
| ~ big_f(X2)
| ~ big_g(X3) ),
inference(subsumption_resolution,[],[f32,f25]) ).
fof(f32,plain,
! [X2,X3] :
( big_h(X2)
| sP0
| ~ big_f(X2)
| ~ big_g(X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f53,plain,
! [X0] :
( big_f(sK2)
| ~ big_g(sK1)
| ~ big_f(X0) ),
inference(subsumption_resolution,[],[f50,f48]) ).
fof(f50,plain,
! [X0] :
( big_f(sK2)
| ~ big_g(sK1)
| sP0
| ~ big_f(X0) ),
inference(resolution,[],[f39,f27]) ).
fof(f27,plain,
( ~ big_j(sK1)
| big_f(sK2)
| sP0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f39,plain,
! [X2,X3] :
( big_j(X3)
| ~ big_f(X2)
| ~ big_g(X3) ),
inference(subsumption_resolution,[],[f31,f26]) ).
fof(f31,plain,
! [X2,X3] :
( big_j(X3)
| ~ big_f(X2)
| sP0
| ~ big_g(X3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f68,plain,
! [X0] : ~ big_f(X0),
inference(resolution,[],[f67,f57]) ).
fof(f67,plain,
! [X0,X1] :
( ~ big_g(X1)
| ~ big_f(X0) ),
inference(subsumption_resolution,[],[f65,f61]) ).
fof(f65,plain,
! [X0,X1] :
( ~ big_g(X1)
| ~ big_f(X0)
| ~ big_f(sK2) ),
inference(resolution,[],[f63,f38]) ).
fof(f63,plain,
! [X1] :
( ~ big_h(sK2)
| ~ big_f(X1) ),
inference(subsumption_resolution,[],[f54,f57]) ).
fof(f54,plain,
! [X1] :
( ~ big_h(sK2)
| ~ big_g(sK1)
| ~ big_f(X1) ),
inference(subsumption_resolution,[],[f51,f48]) ).
fof(f51,plain,
! [X1] :
( sP0
| ~ big_h(sK2)
| ~ big_f(X1)
| ~ big_g(sK1) ),
inference(resolution,[],[f39,f28]) ).
fof(f28,plain,
( ~ big_j(sK1)
| sP0
| ~ big_h(sK2) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN059+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_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 21:47:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (14811)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.50 % (14828)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.50 % (14820)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (14811)First to succeed.
% 0.19/0.50 % (14807)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.50 % (14811)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (14811)------------------------------
% 0.19/0.50 % (14811)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (14811)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (14811)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (14811)Memory used [KB]: 1407
% 0.19/0.50 % (14811)Time elapsed: 0.096 s
% 0.19/0.50 % (14811)Instructions burned: 2 (million)
% 0.19/0.50 % (14811)------------------------------
% 0.19/0.50 % (14811)------------------------------
% 0.19/0.50 % (14803)Success in time 0.154 s
%------------------------------------------------------------------------------