TSTP Solution File: SYN319+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN319+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 : n012.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.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 24 ( 7 avg)
% Number of connectives : 152 ( 48 ~; 34 |; 48 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% Number of variables : 43 ( 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(resolution,[],[f20,f21]) ).
fof(f21,plain,
! [X0] : big_g(X0),
inference(resolution,[],[f19,f11]) ).
fof(f11,plain,
! [X0,X1] :
( big_f(X1)
| big_g(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( ( big_h(X0)
| ( ~ big_f(X0)
& ~ big_g(X0) ) )
& ( ~ big_h(sK0(X0,X1))
| ( ~ big_h(sK0(X0,X1))
& ( big_f(sK0(X0,X1))
| big_g(sK0(X0,X1)) )
& big_h(X1) ) )
& ( ( big_g(X0)
& ~ big_f(sK1(X0,X1)) )
| ( ~ big_g(sK1(X0,X1))
& big_f(X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2,X3] :
( ( big_h(X0)
| ( ~ big_f(X0)
& ~ big_g(X0) ) )
& ( ~ big_h(X2)
| ( ~ big_h(X2)
& ( big_f(X2)
| big_g(X2) )
& big_h(X1) ) )
& ( ( big_g(X0)
& ~ big_f(X3) )
| ( ~ big_g(X3)
& big_f(X1) ) ) )
=> ( ( big_h(X0)
| ( ~ big_f(X0)
& ~ big_g(X0) ) )
& ( ~ big_h(sK0(X0,X1))
| ( ~ big_h(sK0(X0,X1))
& ( big_f(sK0(X0,X1))
| big_g(sK0(X0,X1)) )
& big_h(X1) ) )
& ( ( big_g(X0)
& ~ big_f(sK1(X0,X1)) )
| ( ~ big_g(sK1(X0,X1))
& big_f(X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0,X1] :
? [X2,X3] :
( ( big_h(X0)
| ( ~ big_f(X0)
& ~ big_g(X0) ) )
& ( ~ big_h(X2)
| ( ~ big_h(X2)
& ( big_f(X2)
| big_g(X2) )
& big_h(X1) ) )
& ( ( big_g(X0)
& ~ big_f(X3) )
| ( ~ big_g(X3)
& big_f(X1) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
! [X1,X0] :
? [X2,X3] :
( ( big_h(X1)
| ( ~ big_f(X1)
& ~ big_g(X1) ) )
& ( ~ big_h(X2)
| ( ~ big_h(X2)
& ( big_f(X2)
| big_g(X2) )
& big_h(X0) ) )
& ( ( big_g(X1)
& ~ big_f(X3) )
| ( ~ big_g(X3)
& big_f(X0) ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X0,X1] :
? [X2,X3] :
( ( ( ~ big_h(X2)
& ( big_f(X2)
| big_g(X2) )
& big_h(X0) )
| ~ big_h(X2) )
& ( big_h(X1)
| ( ~ big_f(X1)
& ~ big_g(X1) ) )
& ( ( big_g(X1)
& ~ big_f(X3) )
| ( ~ big_g(X3)
& big_f(X0) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ? [X0,X1] :
! [X2,X3] :
( ( ( big_f(X0)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_g(X1)
| big_f(X1) )
=> big_h(X1) )
=> ( ( big_h(X0)
=> ( ( big_f(X2)
| big_g(X2) )
=> big_h(X2) ) )
& big_h(X2) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X1,X0] :
! [X3,X2] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X1,X0] :
! [X3,X2] :
( ( ( big_f(X1)
=> big_g(X2) )
=> ( ~ big_f(X2)
& big_g(X0) ) )
=> ( ( ( big_g(X0)
| big_f(X0) )
=> big_h(X0) )
=> ( ( big_h(X1)
=> ( ( big_g(X3)
| big_f(X3) )
=> big_h(X3) ) )
& big_h(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_2_5) ).
fof(f19,plain,
! [X0,X1] : ~ big_f(sK0(X0,X1)),
inference(resolution,[],[f18,f17]) ).
fof(f17,plain,
! [X0] :
( big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0,X1] : ~ big_h(sK0(X0,X1)),
inference(duplicate_literal_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ~ big_h(sK0(X0,X1))
| ~ big_h(sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f20,plain,
! [X2,X3] : ~ big_g(sK0(X2,X3)),
inference(resolution,[],[f18,f16]) ).
fof(f16,plain,
! [X0] :
( big_h(X0)
| ~ big_g(X0) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN319+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_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n012.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:41:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.48 % (7884)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.49 % (7900)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/500Mi)
% 0.19/0.49 % (7894)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.49 % (7874)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.19/0.49 TRYING [1]
% 0.19/0.49 TRYING [2]
% 0.19/0.49 TRYING [3]
% 0.19/0.49 TRYING [4]
% 0.19/0.49 % (7892)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.19/0.49 % (7884)First to succeed.
% 0.19/0.50 % (7886)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.50 % (7884)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 % (7884)------------------------------
% 0.19/0.50 % (7884)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (7884)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (7884)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (7884)Memory used [KB]: 895
% 0.19/0.50 % (7884)Time elapsed: 0.096 s
% 0.19/0.50 % (7884)Instructions burned: 2 (million)
% 0.19/0.50 % (7884)------------------------------
% 0.19/0.50 % (7884)------------------------------
% 0.19/0.50 % (7873)Success in time 0.154 s
%------------------------------------------------------------------------------