TSTP Solution File: SYN729+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN729+1 : TPTP v8.1.0. Released v2.5.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 : 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:39:24 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 9 ( 4 avg)
% Number of connectives : 102 ( 31 ~; 21 |; 36 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 43 ( 29 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f69,plain,
$false,
inference(subsumption_resolution,[],[f68,f51]) ).
fof(f51,plain,
p(g(h(sK0(sK1)))),
inference(resolution,[],[f38,f12]) ).
fof(f12,plain,
! [X2] :
( ~ p(X2)
| p(g(X2)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X0] :
( ( p(sK0(X0))
& l(X0,g(h(sK0(X0)))) )
| ~ p(X0) )
& ! [X2] :
( ~ p(X2)
| ( p(h(X2))
& p(g(X2)) ) )
& p(sK1)
& ! [X4] :
( ~ p(X4)
| ~ l(sK1,X4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( ( p(X1)
& l(X0,g(h(X1))) )
| ~ p(X0) )
=> ( ( p(sK0(X0))
& l(X0,g(h(sK0(X0)))) )
| ~ p(X0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X3] :
( p(X3)
& ! [X4] :
( ~ p(X4)
| ~ l(X3,X4) ) )
=> ( p(sK1)
& ! [X4] :
( ~ p(X4)
| ~ l(sK1,X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] :
? [X1] :
( ( p(X1)
& l(X0,g(h(X1))) )
| ~ p(X0) )
& ! [X2] :
( ~ p(X2)
| ( p(h(X2))
& p(g(X2)) ) )
& ? [X3] :
( p(X3)
& ! [X4] :
( ~ p(X4)
| ~ l(X3,X4) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X1] :
? [X2] :
( ( p(X2)
& l(X1,g(h(X2))) )
| ~ p(X1) )
& ! [X0] :
( ~ p(X0)
| ( p(h(X0))
& p(g(X0)) ) )
& ? [X3] :
( p(X3)
& ! [X4] :
( ~ p(X4)
| ~ l(X3,X4) ) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X3] :
( p(X3)
& ! [X4] :
( ~ p(X4)
| ~ l(X3,X4) ) )
& ! [X1] :
? [X2] :
( ( p(X2)
& l(X1,g(h(X2))) )
| ~ p(X1) )
& ! [X0] :
( ~ p(X0)
| ( p(h(X0))
& p(g(X0)) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X1] :
? [X2] :
( p(X1)
=> ( p(X2)
& l(X1,g(h(X2))) ) )
& ! [X0] :
( p(X0)
=> ( p(h(X0))
& p(g(X0)) ) ) )
=> ! [X3] :
( p(X3)
=> ? [X4] :
( p(X4)
& l(X3,X4) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X2] :
( p(X2)
=> ( p(g(X2))
& p(h(X2)) ) )
& ! [X0] :
? [X1] :
( p(X0)
=> ( l(X0,g(h(X1)))
& p(X1) ) ) )
=> ! [X0] :
( p(X0)
=> ? [X1] :
( p(X1)
& l(X0,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X2] :
( p(X2)
=> ( p(g(X2))
& p(h(X2)) ) )
& ! [X0] :
? [X1] :
( p(X0)
=> ( l(X0,g(h(X1)))
& p(X1) ) ) )
=> ! [X0] :
( p(X0)
=> ? [X1] :
( p(X1)
& l(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm72) ).
fof(f38,plain,
p(h(sK0(sK1))),
inference(resolution,[],[f30,f13]) ).
fof(f13,plain,
! [X2] :
( ~ p(X2)
| p(h(X2)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f30,plain,
p(sK0(sK1)),
inference(resolution,[],[f15,f11]) ).
fof(f11,plain,
p(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0] :
( ~ p(X0)
| p(sK0(X0)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f68,plain,
~ p(g(h(sK0(sK1)))),
inference(resolution,[],[f63,f10]) ).
fof(f10,plain,
! [X4] :
( ~ l(sK1,X4)
| ~ p(X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f63,plain,
l(sK1,g(h(sK0(sK1)))),
inference(resolution,[],[f14,f11]) ).
fof(f14,plain,
! [X0] :
( ~ p(X0)
| l(X0,g(h(sK0(X0)))) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN729+1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/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.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 22:17:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48 % (32167)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.49 % (32167)First to succeed.
% 0.19/0.49 % (32167)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (32167)------------------------------
% 0.19/0.49 % (32167)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (32167)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (32167)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (32167)Memory used [KB]: 5373
% 0.19/0.49 % (32167)Time elapsed: 0.109 s
% 0.19/0.49 % (32167)Instructions burned: 2 (million)
% 0.19/0.49 % (32167)------------------------------
% 0.19/0.49 % (32167)------------------------------
% 0.19/0.49 % (32162)Success in time 0.147 s
%------------------------------------------------------------------------------