TSTP Solution File: SYN059+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n021.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:36:43 EDT 2022
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 11 unt; 0 def)
% Number of atoms : 237 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 288 ( 109 ~; 107 |; 51 &)
% ( 4 <=>; 14 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 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 : 78 ( 59 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f75,plain,
$false,
inference(subsumption_resolution,[],[f74,f59]) ).
fof(f59,plain,
sP0,
inference(resolution,[],[f55,f25]) ).
fof(f25,plain,
big_f(sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
big_f(sK1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f1,f11]) ).
fof(f11,plain,
( ? [X0] : big_f(X0)
=> big_f(sK1) ),
introduced(choice_axiom,[]) ).
fof(f1,axiom,
? [X0] : big_f(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_1) ).
fof(f55,plain,
! [X1] :
( ~ big_f(X1)
| sP0 ),
inference(resolution,[],[f51,f26]) ).
fof(f26,plain,
big_g(sK2),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
big_g(sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f5,f13]) ).
fof(f13,plain,
( ? [X0] : big_g(X0)
=> big_g(sK2) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0] : big_g(X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
? [X1] : big_g(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29_2) ).
fof(f51,plain,
! [X0,X1] :
( ~ big_g(X1)
| ~ big_f(X0)
| sP0 ),
inference(subsumption_resolution,[],[f50,f43]) ).
fof(f43,plain,
( big_f(sK3)
| sP0 ),
inference(resolution,[],[f41,f25]) ).
fof(f41,plain,
! [X0] :
( ~ big_f(X0)
| big_f(sK3)
| sP0 ),
inference(subsumption_resolution,[],[f40,f30]) ).
fof(f30,plain,
( big_g(sK4)
| big_f(sK3)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ( sP0
| ( ~ big_h(sK3)
& big_f(sK3) )
| ( big_g(sK4)
& ~ big_j(sK4) ) )
& ( ( ! [X2] :
( big_h(X2)
| ~ big_f(X2) )
& ! [X3] :
( ~ big_g(X3)
| big_j(X3) ) )
| ~ sP0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f17,f19,f18]) ).
fof(f18,plain,
( ? [X0] :
( ~ big_h(X0)
& big_f(X0) )
=> ( ~ big_h(sK3)
& big_f(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ? [X1] :
( big_g(X1)
& ~ big_j(X1) )
=> ( big_g(sK4)
& ~ big_j(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ( sP0
| ? [X0] :
( ~ big_h(X0)
& big_f(X0) )
| ? [X1] :
( big_g(X1)
& ~ big_j(X1) ) )
& ( ( ! [X2] :
( big_h(X2)
| ~ big_f(X2) )
& ! [X3] :
( ~ big_g(X3)
| big_j(X3) ) )
| ~ sP0 ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
( ( sP0
| ? [X0] :
( ~ big_h(X0)
& big_f(X0) )
| ? [X1] :
( big_g(X1)
& ~ big_j(X1) ) )
& ( ( ! [X0] :
( big_h(X0)
| ~ big_f(X0) )
& ! [X1] :
( ~ big_g(X1)
| big_j(X1) ) )
| ~ sP0 ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
( ( sP0
| ? [X0] :
( ~ big_h(X0)
& big_f(X0) )
| ? [X1] :
( big_g(X1)
& ~ big_j(X1) ) )
& ( ( ! [X0] :
( big_h(X0)
| ~ big_f(X0) )
& ! [X1] :
( ~ big_g(X1)
| big_j(X1) ) )
| ~ sP0 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
( sP0
<=> ( ! [X0] :
( big_h(X0)
| ~ big_f(X0) )
& ! [X1] :
( ~ big_g(X1)
| big_j(X1) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f40,plain,
! [X0] :
( sP0
| ~ big_f(X0)
| ~ big_g(sK4)
| big_f(sK3) ),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ~ big_f(X0)
| sP0
| ~ big_g(sK4)
| sP0
| big_f(sK3) ),
inference(resolution,[],[f29,f33]) ).
fof(f33,plain,
! [X2,X3] :
( big_j(X2)
| ~ big_g(X2)
| sP0
| ~ big_f(X3) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
( ( ~ sP0
| ( ( ~ big_h(sK6)
| ~ big_j(sK5) )
& big_g(sK5)
& big_f(sK6) ) )
& ( sP0
| ! [X2,X3] :
( ( big_h(X3)
& big_j(X2) )
| ~ big_g(X2)
| ~ big_f(X3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f22,f23]) ).
fof(f23,plain,
( ? [X0,X1] :
( ( ~ big_h(X1)
| ~ big_j(X0) )
& big_g(X0)
& big_f(X1) )
=> ( ( ~ big_h(sK6)
| ~ big_j(sK5) )
& big_g(sK5)
& big_f(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ( ~ sP0
| ? [X0,X1] :
( ( ~ big_h(X1)
| ~ big_j(X0) )
& big_g(X0)
& big_f(X1) ) )
& ( sP0
| ! [X2,X3] :
( ( big_h(X3)
& big_j(X2) )
| ~ big_g(X2)
| ~ big_f(X3) ) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
( ( ~ sP0
| ? [X3,X2] :
( ( ~ big_h(X2)
| ~ big_j(X3) )
& big_g(X3)
& big_f(X2) ) )
& ( sP0
| ! [X3,X2] :
( ( big_h(X2)
& big_j(X3) )
| ~ big_g(X3)
| ~ big_f(X2) ) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
( ! [X3,X2] :
( ( big_h(X2)
& big_j(X3) )
| ~ big_g(X3)
| ~ big_f(X2) )
<~> sP0 ),
inference(definition_folding,[],[f8,f9]) ).
fof(f8,plain,
( ! [X3,X2] :
( ( big_h(X2)
& big_j(X3) )
| ~ big_g(X3)
| ~ big_f(X2) )
<~> ( ! [X0] :
( big_h(X0)
| ~ big_f(X0) )
& ! [X1] :
( ~ big_g(X1)
| big_j(X1) ) ) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
( ! [X3,X2] :
( ( big_h(X2)
& big_j(X3) )
| ~ big_g(X3)
| ~ big_f(X2) )
<~> ( ! [X0] :
( big_h(X0)
| ~ big_f(X0) )
& ! [X1] :
( ~ big_g(X1)
| big_j(X1) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
~ ( ! [X3,X2] :
( ( big_g(X3)
& big_f(X2) )
=> ( big_h(X2)
& big_j(X3) ) )
<=> ( ! [X0] :
( big_f(X0)
=> big_h(X0) )
& ! [X1] :
( big_g(X1)
=> big_j(X1) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ( ( ! [X0] :
( big_f(X0)
=> big_h(X0) )
& ! [X2] :
( big_g(X2)
=> big_j(X2) ) )
<=> ! [X3,X1] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_j(X1)
& big_h(X3) ) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
( ( ! [X0] :
( big_f(X0)
=> big_h(X0) )
& ! [X2] :
( big_g(X2)
=> big_j(X2) ) )
<=> ! [X3,X1] :
( ( big_g(X1)
& big_f(X3) )
=> ( big_j(X1)
& big_h(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel29) ).
fof(f29,plain,
( ~ big_j(sK4)
| sP0
| big_f(sK3) ),
inference(cnf_transformation,[],[f20]) ).
fof(f50,plain,
! [X0,X1] :
( sP0
| ~ big_f(sK3)
| ~ big_g(X1)
| ~ big_f(X0) ),
inference(duplicate_literal_removal,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ~ big_g(X1)
| sP0
| ~ big_f(sK3)
| sP0
| ~ big_f(X0) ),
inference(resolution,[],[f48,f34]) ).
fof(f34,plain,
! [X2,X3] :
( big_h(X3)
| ~ big_f(X3)
| ~ big_g(X2)
| sP0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f48,plain,
! [X0] :
( ~ big_h(sK3)
| ~ big_f(X0)
| sP0 ),
inference(subsumption_resolution,[],[f47,f32]) ).
fof(f32,plain,
( ~ big_h(sK3)
| big_g(sK4)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f47,plain,
! [X0] :
( sP0
| ~ big_f(X0)
| ~ big_g(sK4)
| ~ big_h(sK3) ),
inference(duplicate_literal_removal,[],[f46]) ).
fof(f46,plain,
! [X0] :
( sP0
| ~ big_g(sK4)
| sP0
| ~ big_f(X0)
| ~ big_h(sK3) ),
inference(resolution,[],[f31,f33]) ).
fof(f31,plain,
( ~ big_j(sK4)
| ~ big_h(sK3)
| sP0 ),
inference(cnf_transformation,[],[f20]) ).
fof(f74,plain,
~ sP0,
inference(resolution,[],[f73,f35]) ).
fof(f35,plain,
( big_f(sK6)
| ~ sP0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f73,plain,
~ big_f(sK6),
inference(subsumption_resolution,[],[f72,f59]) ).
fof(f72,plain,
( ~ big_f(sK6)
| ~ sP0 ),
inference(resolution,[],[f70,f36]) ).
fof(f36,plain,
( big_g(sK5)
| ~ sP0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f70,plain,
( ~ big_g(sK5)
| ~ big_f(sK6) ),
inference(resolution,[],[f69,f62]) ).
fof(f62,plain,
! [X0] :
( big_h(X0)
| ~ big_f(X0) ),
inference(resolution,[],[f59,f28]) ).
fof(f28,plain,
! [X2] :
( ~ sP0
| big_h(X2)
| ~ big_f(X2) ),
inference(cnf_transformation,[],[f20]) ).
fof(f69,plain,
( ~ big_h(sK6)
| ~ big_g(sK5) ),
inference(subsumption_resolution,[],[f66,f59]) ).
fof(f66,plain,
( ~ big_g(sK5)
| ~ big_h(sK6)
| ~ sP0 ),
inference(resolution,[],[f63,f37]) ).
fof(f37,plain,
( ~ big_j(sK5)
| ~ big_h(sK6)
| ~ sP0 ),
inference(cnf_transformation,[],[f24]) ).
fof(f63,plain,
! [X1] :
( big_j(X1)
| ~ big_g(X1) ),
inference(resolution,[],[f59,f27]) ).
fof(f27,plain,
! [X3] :
( ~ sP0
| big_j(X3)
| ~ big_g(X3) ),
inference(cnf_transformation,[],[f20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN059+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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 : n021.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:22:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49 % (1790)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.18/0.49 % (1791)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.18/0.50 % (1808)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.18/0.50 % (1793)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.50 % (1794)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.18/0.50 % (1803)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.18/0.50 % (1791)First to succeed.
% 0.18/0.50 % (1789)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/191324Mi)
% 0.18/0.50 % (1791)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (1791)------------------------------
% 0.18/0.50 % (1791)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (1791)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (1791)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (1791)Memory used [KB]: 895
% 0.18/0.50 % (1791)Time elapsed: 0.107 s
% 0.18/0.50 % (1791)Instructions burned: 2 (million)
% 0.18/0.50 % (1791)------------------------------
% 0.18/0.50 % (1791)------------------------------
% 0.18/0.50 % (1788)Success in time 0.16 s
%------------------------------------------------------------------------------