TSTP Solution File: GEO209+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : GEO209+3 : TPTP v8.1.0. Released v4.0.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 : n007.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:09:14 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 98 ( 27 ~; 17 |; 43 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 68 ( 52 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(subsumption_resolution,[],[f100,f88]) ).
fof(f88,plain,
~ convergent_lines(sK1,sK2),
inference(resolution,[],[f75,f71]) ).
fof(f71,plain,
parallel_lines(sK1,sK2),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
( parallel_lines(sK3,sK2)
& ~ equal_lines(sK3,sK1)
& incident_point_and_line(sK0,sK3)
& parallel_lines(sK1,sK2)
& apart_point_and_line(sK0,sK2)
& incident_point_and_line(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f60,f61]) ).
fof(f61,plain,
( ? [X0,X1,X2,X3] :
( parallel_lines(X3,X2)
& ~ equal_lines(X3,X1)
& incident_point_and_line(X0,X3)
& parallel_lines(X1,X2)
& apart_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) )
=> ( parallel_lines(sK3,sK2)
& ~ equal_lines(sK3,sK1)
& incident_point_and_line(sK0,sK3)
& parallel_lines(sK1,sK2)
& apart_point_and_line(sK0,sK2)
& incident_point_and_line(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
? [X0,X1,X2,X3] :
( parallel_lines(X3,X2)
& ~ equal_lines(X3,X1)
& incident_point_and_line(X0,X3)
& parallel_lines(X1,X2)
& apart_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) ),
inference(rectify,[],[f59]) ).
fof(f59,plain,
? [X0,X3,X2,X1] :
( parallel_lines(X1,X2)
& ~ equal_lines(X1,X3)
& incident_point_and_line(X0,X1)
& parallel_lines(X3,X2)
& apart_point_and_line(X0,X2)
& incident_point_and_line(X0,X3) ),
inference(flattening,[],[f58]) ).
fof(f58,plain,
? [X1,X3,X0,X2] :
( ~ equal_lines(X1,X3)
& parallel_lines(X1,X2)
& parallel_lines(X3,X2)
& incident_point_and_line(X0,X3)
& apart_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,plain,
~ ! [X1,X3,X0,X2] :
( ( parallel_lines(X1,X2)
& parallel_lines(X3,X2)
& incident_point_and_line(X0,X3)
& apart_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) )
=> equal_lines(X1,X3) ),
inference(rectify,[],[f37]) ).
fof(f37,negated_conjecture,
~ ! [X8,X6,X5,X7] :
( ( incident_point_and_line(X8,X7)
& parallel_lines(X7,X5)
& incident_point_and_line(X8,X6)
& apart_point_and_line(X8,X5)
& parallel_lines(X6,X5) )
=> equal_lines(X6,X7) ),
inference(negated_conjecture,[],[f36]) ).
fof(f36,conjecture,
! [X8,X6,X5,X7] :
( ( incident_point_and_line(X8,X7)
& parallel_lines(X7,X5)
& incident_point_and_line(X8,X6)
& apart_point_and_line(X8,X5)
& parallel_lines(X6,X5) )
=> equal_lines(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f75,plain,
! [X0,X1] :
( ~ parallel_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ parallel_lines(X0,X1) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( parallel_lines(X0,X1)
=> ~ convergent_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f33,axiom,
! [X0,X1] :
( parallel_lines(X0,X1)
<=> ~ convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3) ).
fof(f100,plain,
convergent_lines(sK1,sK2),
inference(resolution,[],[f97,f84]) ).
fof(f84,plain,
! [X0,X1] :
( ~ distinct_lines(X1,X0)
| convergent_lines(X1,X0) ),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( ~ distinct_lines(X1,X0)
| convergent_lines(X1,X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f40,plain,
! [X1,X0] :
( distinct_lines(X1,X0)
=> convergent_lines(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X1,X0] :
( distinct_lines(X0,X1)
=> convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).
fof(f97,plain,
distinct_lines(sK1,sK2),
inference(resolution,[],[f96,f89]) ).
fof(f89,plain,
~ convergent_lines(sK3,sK2),
inference(resolution,[],[f75,f74]) ).
fof(f74,plain,
parallel_lines(sK3,sK2),
inference(cnf_transformation,[],[f62]) ).
fof(f96,plain,
! [X0] :
( convergent_lines(sK3,X0)
| distinct_lines(sK1,X0) ),
inference(resolution,[],[f76,f95]) ).
fof(f95,plain,
convergent_lines(sK3,sK1),
inference(resolution,[],[f84,f90]) ).
fof(f90,plain,
distinct_lines(sK3,sK1),
inference(resolution,[],[f78,f73]) ).
fof(f73,plain,
~ equal_lines(sK3,sK1),
inference(cnf_transformation,[],[f62]) ).
fof(f78,plain,
! [X0,X1] :
( equal_lines(X1,X0)
| distinct_lines(X1,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( ( ~ distinct_lines(X1,X0)
| ~ equal_lines(X1,X0) )
& ( equal_lines(X1,X0)
| distinct_lines(X1,X0) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0,X1] :
( ~ distinct_lines(X1,X0)
<=> equal_lines(X1,X0) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X1,X0] :
( equal_lines(X0,X1)
<=> ~ distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X0)
| distinct_lines(X2,X0) ),
inference(cnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1,X2] :
( convergent_lines(X1,X0)
| distinct_lines(X2,X0)
| ~ convergent_lines(X1,X2) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f48]) ).
fof(f48,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| distinct_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,axiom,
! [X2,X0,X1] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ceq3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO209+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/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 : n007.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 21:13:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48 % (4630)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.48 % (4630)First to succeed.
% 0.20/0.48 % (4630)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (4630)------------------------------
% 0.20/0.48 % (4630)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (4630)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (4630)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (4630)Memory used [KB]: 6012
% 0.20/0.48 % (4630)Time elapsed: 0.065 s
% 0.20/0.48 % (4630)Instructions burned: 2 (million)
% 0.20/0.48 % (4630)------------------------------
% 0.20/0.48 % (4630)------------------------------
% 0.20/0.48 % (4622)Success in time 0.125 s
%------------------------------------------------------------------------------