TSTP Solution File: GEO226+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n028.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 May 31 12:08:26 EDT 2023
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 20 ~; 12 |; 18 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 29 (; 23 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,conjecture,
! [L,M] :
( ( line(L)
& line(M)
& convergent_lines(L,M) )
=> ? [X] :
( point(X)
=> ( ~ apart_point_and_line(X,L)
& ~ apart_point_and_line(X,M) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
~ ! [L,M] :
( ( line(L)
& line(M)
& convergent_lines(L,M) )
=> ? [X] :
( point(X)
=> ( ~ apart_point_and_line(X,L)
& ~ apart_point_and_line(X,M) ) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f37,plain,
! [X,Y] :
( ~ convergent_lines(X,Y)
| ~ apart_point_and_line(intersection_point(X,Y),X) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f38,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(cnf_transformation,[status(esa)],[f37]) ).
fof(f39,plain,
! [X,Y] :
( ~ convergent_lines(X,Y)
| ~ apart_point_and_line(intersection_point(X,Y),Y) ),
inference(pre_NNF_transformation,[status(esa)],[f10]) ).
fof(f40,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f60,plain,
? [L,M] :
( line(L)
& line(M)
& convergent_lines(L,M)
& ! [X] :
( point(X)
& ( apart_point_and_line(X,L)
| apart_point_and_line(X,M) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f20]) ).
fof(f61,plain,
? [L,M] :
( line(L)
& line(M)
& convergent_lines(L,M)
& ! [X] : point(X)
& ! [X] :
( apart_point_and_line(X,L)
| apart_point_and_line(X,M) ) ),
inference(miniscoping,[status(esa)],[f60]) ).
fof(f62,plain,
( line(sk0_0)
& line(sk0_1)
& convergent_lines(sk0_0,sk0_1)
& ! [X] : point(X)
& ! [X] :
( apart_point_and_line(X,sk0_0)
| apart_point_and_line(X,sk0_1) ) ),
inference(skolemization,[status(esa)],[f61]) ).
fof(f65,plain,
convergent_lines(sk0_0,sk0_1),
inference(cnf_transformation,[status(esa)],[f62]) ).
fof(f67,plain,
! [X0] :
( apart_point_and_line(X0,sk0_0)
| apart_point_and_line(X0,sk0_1) ),
inference(cnf_transformation,[status(esa)],[f62]) ).
fof(f82,plain,
! [X0] :
( ~ convergent_lines(X0,sk0_1)
| apart_point_and_line(intersection_point(X0,sk0_1),sk0_0) ),
inference(resolution,[status(thm)],[f40,f67]) ).
fof(f94,plain,
( spl0_1
<=> convergent_lines(sk0_0,sk0_1) ),
introduced(split_symbol_definition) ).
fof(f96,plain,
( ~ convergent_lines(sk0_0,sk0_1)
| spl0_1 ),
inference(component_clause,[status(thm)],[f94]) ).
fof(f97,plain,
( ~ convergent_lines(sk0_0,sk0_1)
| ~ convergent_lines(sk0_0,sk0_1) ),
inference(resolution,[status(thm)],[f82,f38]) ).
fof(f98,plain,
~ spl0_1,
inference(split_clause,[status(thm)],[f97,f94]) ).
fof(f101,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f96,f65]) ).
fof(f102,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f101]) ).
fof(f103,plain,
$false,
inference(sat_refutation,[status(thm)],[f98,f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO226+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n028.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 : Tue May 30 12:15:47 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.57 % Elapsed time: 0.011632 seconds
% 0.19/0.57 % CPU time: 0.031000 seconds
% 0.19/0.57 % Memory used: 2.009 MB
%------------------------------------------------------------------------------