TSTP Solution File: GEO176+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.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 : n029.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 16:08:57 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 5 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 112 ( 41 ~; 39 |; 21 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 50 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(avatar_sat_refutation,[],[f56,f74,f83]) ).
fof(f83,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| ~ spl4_1 ),
inference(subsumption_resolution,[],[f80,f47]) ).
fof(f47,plain,
convergent_lines(sK3,sK2),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
( convergent_lines(sK3,sK2)
& ( apart_point_and_line(sK1,sK3)
| apart_point_and_line(sK1,sK2) )
& distinct_points(sK1,sK0)
& ~ distinct_points(sK1,intersection_point(sK3,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f28,f35]) ).
fof(f35,plain,
( ? [X0,X1,X2,X3] :
( convergent_lines(X3,X2)
& ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2) )
& distinct_points(X1,X0)
& ~ distinct_points(X1,intersection_point(X3,X2)) )
=> ( convergent_lines(sK3,sK2)
& ( apart_point_and_line(sK1,sK3)
| apart_point_and_line(sK1,sK2) )
& distinct_points(sK1,sK0)
& ~ distinct_points(sK1,intersection_point(sK3,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
? [X0,X1,X2,X3] :
( convergent_lines(X3,X2)
& ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2) )
& distinct_points(X1,X0)
& ~ distinct_points(X1,intersection_point(X3,X2)) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
? [X2,X1,X0,X3] :
( ~ distinct_points(X1,intersection_point(X3,X2))
& distinct_points(X1,X0)
& ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2) )
& convergent_lines(X3,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X2,X1,X0,X3] :
( ( distinct_points(X1,X0)
& ( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X2) )
& convergent_lines(X3,X2) )
=> distinct_points(X1,intersection_point(X3,X2)) ),
inference(rectify,[],[f16]) ).
fof(f16,negated_conjecture,
~ ! [X1,X0,X4,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X4) )
& distinct_points(X0,X1)
& convergent_lines(X3,X4) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
inference(negated_conjecture,[],[f15]) ).
fof(f15,conjecture,
! [X1,X0,X4,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X4) )
& distinct_points(X0,X1)
& convergent_lines(X3,X4) )
=> distinct_points(X0,intersection_point(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f80,plain,
( ~ convergent_lines(sK3,sK2)
| ~ spl4_1 ),
inference(resolution,[],[f77,f44]) ).
fof(f44,plain,
~ distinct_points(sK1,intersection_point(sK3,sK2)),
inference(cnf_transformation,[],[f36]) ).
fof(f77,plain,
( ! [X1] :
( distinct_points(sK1,intersection_point(X1,sK2))
| ~ convergent_lines(X1,sK2) )
| ~ spl4_1 ),
inference(resolution,[],[f75,f40]) ).
fof(f40,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X1,X0),X0)
| ~ convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X1,X0),X0)
| ~ convergent_lines(X1,X0) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ~ apart_point_and_line(intersection_point(X0,X1),X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X1,X0] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci4) ).
fof(f75,plain,
( ! [X0] :
( apart_point_and_line(X0,sK2)
| distinct_points(sK1,X0) )
| ~ spl4_1 ),
inference(resolution,[],[f51,f43]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X1,X0)
| distinct_points(X1,X2)
| apart_point_and_line(X2,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( apart_point_and_line(X2,X0)
| ~ apart_point_and_line(X1,X0)
| distinct_points(X1,X2) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
! [X1,X2,X0] :
( apart_point_and_line(X0,X1)
| ~ apart_point_and_line(X2,X1)
| distinct_points(X2,X0) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X1,X2,X0] :
( distinct_points(X2,X0)
| apart_point_and_line(X0,X1)
| ~ apart_point_and_line(X2,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X1,X2,X0] :
( apart_point_and_line(X2,X1)
=> ( distinct_points(X2,X0)
| apart_point_and_line(X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X2,X1,X0] :
( apart_point_and_line(X0,X1)
=> ( distinct_points(X0,X2)
| apart_point_and_line(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ceq1) ).
fof(f51,plain,
( apart_point_and_line(sK1,sK2)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f49,plain,
( spl4_1
<=> apart_point_and_line(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f74,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f71,f47]) ).
fof(f71,plain,
( ~ convergent_lines(sK3,sK2)
| ~ spl4_2 ),
inference(resolution,[],[f68,f44]) ).
fof(f68,plain,
( ! [X0] :
( distinct_points(sK1,intersection_point(sK3,X0))
| ~ convergent_lines(sK3,X0) )
| ~ spl4_2 ),
inference(resolution,[],[f59,f38]) ).
fof(f38,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X1,X0),X1)
| ~ convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ~ convergent_lines(X1,X0)
| ~ apart_point_and_line(intersection_point(X1,X0),X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( convergent_lines(X1,X0)
=> ~ apart_point_and_line(intersection_point(X1,X0),X1) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci3) ).
fof(f59,plain,
( ! [X0] :
( apart_point_and_line(X0,sK3)
| distinct_points(sK1,X0) )
| ~ spl4_2 ),
inference(resolution,[],[f43,f55]) ).
fof(f55,plain,
( apart_point_and_line(sK1,sK3)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl4_2
<=> apart_point_and_line(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f56,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f46,f53,f49]) ).
fof(f46,plain,
( apart_point_and_line(sK1,sK3)
| apart_point_and_line(sK1,sK2) ),
inference(cnf_transformation,[],[f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/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.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 21:33:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (15059)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (15067)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.50 % (15067)First to succeed.
% 0.20/0.50 TRYING [1]
% 0.20/0.50 TRYING [2]
% 0.20/0.50 % (15059)Instruction limit reached!
% 0.20/0.50 % (15059)------------------------------
% 0.20/0.50 % (15059)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (15059)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (15059)Termination reason: Unknown
% 0.20/0.50 % (15059)Termination phase: Finite model building SAT solving
% 0.20/0.50
% 0.20/0.50 % (15059)Memory used [KB]: 5884
% 0.20/0.50 % (15059)Time elapsed: 0.087 s
% 0.20/0.50 % (15059)Instructions burned: 3 (million)
% 0.20/0.50 % (15059)------------------------------
% 0.20/0.50 % (15059)------------------------------
% 0.20/0.50 % (15067)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (15067)------------------------------
% 0.20/0.50 % (15067)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (15067)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (15067)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (15067)Memory used [KB]: 5884
% 0.20/0.50 % (15067)Time elapsed: 0.087 s
% 0.20/0.50 % (15067)Instructions burned: 3 (million)
% 0.20/0.50 % (15067)------------------------------
% 0.20/0.50 % (15067)------------------------------
% 0.20/0.50 % (15041)Success in time 0.148 s
%------------------------------------------------------------------------------