TSTP Solution File: GEO176+2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GEO176+2 : 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 : n011.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.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 6 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 65 ( 22 ~; 20 |; 14 &)
% ( 2 <=>; 7 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f103,plain,
$false,
inference(avatar_sat_refutation,[],[f67,f100,f102]) ).
fof(f102,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f101]) ).
fof(f101,plain,
( $false
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f88,f52]) ).
fof(f52,plain,
convergent_lines(sK3,sK1),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
? [X3,X0,X1,X2] :
( ( apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X0) )
& distinct_points(X3,X1)
& ~ distinct_points(X3,intersection_point(X2,X0))
& convergent_lines(X2,X0) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
? [X2,X1,X0,X3] :
( ~ distinct_points(X3,intersection_point(X2,X0))
& distinct_points(X3,X1)
& ( apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X0) )
& convergent_lines(X2,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
~ ! [X2,X1,X0,X3] :
( ( distinct_points(X3,X1)
& ( apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X0) )
& convergent_lines(X2,X0) )
=> distinct_points(X3,intersection_point(X2,X0)) ),
inference(rectify,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X4,X1,X3,X0] :
( ( ( 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,[],[f13]) ).
fof(f13,conjecture,
! [X4,X1,X3,X0] :
( ( ( 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(f88,plain,
( ~ convergent_lines(sK3,sK1)
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f66,f53,f56]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X1,X2)
| ~ convergent_lines(X0,X2)
| distinct_points(X1,intersection_point(X0,X2)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X1,X2,X0] :
( ~ convergent_lines(X0,X2)
| distinct_points(X1,intersection_point(X0,X2))
| ( ~ apart_point_and_line(X1,X0)
& ~ apart_point_and_line(X1,X2) ) ),
inference(flattening,[],[f38]) ).
fof(f38,plain,
! [X2,X1,X0] :
( distinct_points(X1,intersection_point(X0,X2))
| ( ~ apart_point_and_line(X1,X0)
& ~ apart_point_and_line(X1,X2) )
| ~ convergent_lines(X0,X2) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X1,X0] :
( convergent_lines(X0,X2)
=> ( ( apart_point_and_line(X1,X0)
| apart_point_and_line(X1,X2) )
=> distinct_points(X1,intersection_point(X0,X2)) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X2,X1] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con2) ).
fof(f53,plain,
~ distinct_points(sK0,intersection_point(sK3,sK1)),
inference(cnf_transformation,[],[f37]) ).
fof(f66,plain,
( apart_point_and_line(sK0,sK1)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl4_2
<=> apart_point_and_line(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f100,plain,
~ spl4_1,
inference(avatar_split_clause,[],[f87,f60]) ).
fof(f60,plain,
( spl4_1
<=> apart_point_and_line(sK0,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f87,plain,
~ apart_point_and_line(sK0,sK3),
inference(unit_resulting_resolution,[],[f52,f53,f57]) ).
fof(f57,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X1,X0)
| distinct_points(X1,intersection_point(X0,X2))
| ~ convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f39]) ).
fof(f67,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f51,f64,f60]) ).
fof(f51,plain,
( apart_point_and_line(sK0,sK1)
| apart_point_and_line(sK0,sK3) ),
inference(cnf_transformation,[],[f37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO176+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Mon Aug 29 21:21:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (22621)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.51 % (22637)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.52 % (22625)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52 % (22625)First to succeed.
% 0.20/0.53 % (22621)Instruction limit reached!
% 0.20/0.53 % (22621)------------------------------
% 0.20/0.53 % (22621)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (22637)Also succeeded, but the first one will report.
% 0.20/0.53 % (22625)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (22625)------------------------------
% 0.20/0.53 % (22625)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (22625)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (22625)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (22625)Memory used [KB]: 5884
% 0.20/0.53 % (22625)Time elapsed: 0.110 s
% 0.20/0.53 % (22625)Instructions burned: 2 (million)
% 0.20/0.53 % (22625)------------------------------
% 0.20/0.53 % (22625)------------------------------
% 0.20/0.53 % (22614)Success in time 0.181 s
%------------------------------------------------------------------------------