TSTP Solution File: SYN728+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN728+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_uns --cores 0 -t %d %s
% Computer : n002.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:28:14 EDT 2022
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 2 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 144 ( 55 ~; 44 |; 30 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 77 ( 60 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f29,f31,f42,f50]) ).
fof(f50,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f43,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(unit_resulting_resolution,[],[f20,f28]) ).
fof(f28,plain,
( ! [X3] : ~ p(g(sK1),X3)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_4
<=> ! [X3] : ~ p(g(sK1),X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f20,plain,
( ! [X7] : p(X7,X7)
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_2
<=> ! [X7] : p(X7,X7) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f42,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f41]) ).
fof(f41,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f38,f17]) ).
fof(f17,plain,
( ! [X6,X5] : ~ p(X5,X6)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f16]) ).
fof(f16,plain,
( spl2_1
<=> ! [X6,X5] : ~ p(X5,X6) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f38,plain,
( ! [X0] : p(X0,sK0(X0))
| ~ spl2_1 ),
inference(unit_resulting_resolution,[],[f37,f13]) ).
fof(f13,plain,
! [X0] :
( p(X0,sK0(X0))
| q(f(X0,sK0(X0))) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ! [X0] :
( p(X0,sK0(X0))
| ( m(X0)
& q(f(X0,sK0(X0))) ) )
& ! [X3] :
( ~ p(sK1,sK1)
| ~ p(g(sK1),X3) )
& ! [X4] :
( ~ m(g(X4))
| ~ q(X4) )
& ! [X5] :
( ! [X6] : ~ p(X5,X6)
| ! [X7] : p(X7,X7) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( p(X0,X1)
| ( m(X0)
& q(f(X0,X1)) ) )
=> ( p(X0,sK0(X0))
| ( m(X0)
& q(f(X0,sK0(X0))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] :
! [X3] :
( ~ p(X2,X2)
| ~ p(g(X2),X3) )
=> ! [X3] :
( ~ p(sK1,sK1)
| ~ p(g(sK1),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] :
? [X1] :
( p(X0,X1)
| ( m(X0)
& q(f(X0,X1)) ) )
& ? [X2] :
! [X3] :
( ~ p(X2,X2)
| ~ p(g(X2),X3) )
& ! [X4] :
( ~ m(g(X4))
| ~ q(X4) )
& ! [X5] :
( ! [X6] : ~ p(X5,X6)
| ! [X7] : p(X7,X7) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X0] :
? [X1] :
( p(X0,X1)
| ( m(X0)
& q(f(X0,X1)) ) )
& ? [X6] :
! [X7] :
( ~ p(X6,X6)
| ~ p(g(X6),X7) )
& ! [X2] :
( ~ m(g(X2))
| ~ q(X2) )
& ! [X3] :
( ! [X4] : ~ p(X3,X4)
| ! [X5] : p(X5,X5) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X6] :
! [X7] :
( ~ p(X6,X6)
| ~ p(g(X6),X7) )
& ! [X2] :
( ~ m(g(X2))
| ~ q(X2) )
& ! [X3] :
( ! [X4] : ~ p(X3,X4)
| ! [X5] : p(X5,X5) )
& ! [X0] :
? [X1] :
( p(X0,X1)
| ( m(X0)
& q(f(X0,X1)) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X2] :
( q(X2)
=> ~ m(g(X2)) )
& ! [X3] :
( ? [X4] : p(X3,X4)
=> ! [X5] : p(X5,X5) )
& ! [X0] :
? [X1] :
( p(X0,X1)
| ( m(X0)
& q(f(X0,X1)) ) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ! [X3] :
? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
& ! [X5] :
( q(X5)
=> ~ m(g(X5)) )
& ! [X0] :
( ? [X1] : p(X0,X1)
=> ! [X2] : p(X2,X2) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ! [X3] :
? [X4] :
( ( q(f(X3,X4))
& m(X3) )
| p(X3,X4) )
& ! [X5] :
( q(X5)
=> ~ m(g(X5)) )
& ! [X0] :
( ? [X1] : p(X0,X1)
=> ! [X2] : p(X2,X2) ) )
=> ! [X6] :
? [X7] :
( p(X6,X6)
& p(g(X6),X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm69) ).
fof(f37,plain,
( ! [X0] : ~ q(X0)
| ~ spl2_1 ),
inference(resolution,[],[f33,f11]) ).
fof(f11,plain,
! [X4] :
( ~ m(g(X4))
| ~ q(X4) ),
inference(cnf_transformation,[],[f9]) ).
fof(f33,plain,
( ! [X0] : m(X0)
| ~ spl2_1 ),
inference(resolution,[],[f14,f17]) ).
fof(f14,plain,
! [X0] :
( p(X0,sK0(X0))
| m(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f31,plain,
( ~ spl2_2
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| ~ spl2_2
| spl2_3 ),
inference(subsumption_resolution,[],[f25,f20]) ).
fof(f25,plain,
( ~ p(sK1,sK1)
| spl2_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl2_3
<=> p(sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f29,plain,
( ~ spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f12,f27,f23]) ).
fof(f12,plain,
! [X3] :
( ~ p(g(sK1),X3)
| ~ p(sK1,sK1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f21,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f10,f19,f16]) ).
fof(f10,plain,
! [X6,X7,X5] :
( p(X7,X7)
| ~ p(X5,X6) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN728+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_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n002.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 22:30:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 % (18356)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.46 % (18344)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.21/0.46 % (18344)First to succeed.
% 0.21/0.46 % (18344)Refutation found. Thanks to Tanya!
% 0.21/0.46 % SZS status Theorem for theBenchmark
% 0.21/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.46 % (18344)------------------------------
% 0.21/0.46 % (18344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.46 % (18344)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.46 % (18344)Termination reason: Refutation
% 0.21/0.46
% 0.21/0.46 % (18344)Memory used [KB]: 5884
% 0.21/0.46 % (18344)Time elapsed: 0.056 s
% 0.21/0.46 % (18344)Instructions burned: 1 (million)
% 0.21/0.46 % (18344)------------------------------
% 0.21/0.46 % (18344)------------------------------
% 0.21/0.46 % (18336)Success in time 0.107 s
%------------------------------------------------------------------------------