TSTP Solution File: GEO261+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : GEO261+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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:36 EDT 2023
% Result : Theorem 0.09s 0.34s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 79 ( 34 ~; 20 |; 21 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 56 (; 46 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [L,M] :
( convergent_lines(L,M)
<=> ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [L,M] :
( ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) )
=> ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [L,M] :
~ ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,conjecture,
! [L,M,A,B,C] :
( ( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& ~ apart_point_and_line(B,M) )
=> divides_points(M,A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
~ ! [L,M,A,B,C] :
( ( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& ~ apart_point_and_line(B,M) )
=> divides_points(M,A,C) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f39,plain,
! [L,M] :
( ( ~ convergent_lines(L,M)
| ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) ) )
& ( convergent_lines(L,M)
| ~ unequally_directed_lines(L,M)
| ~ unequally_directed_lines(L,reverse_line(M)) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f40,plain,
( ! [L,M] :
( ~ convergent_lines(L,M)
| ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) ) )
& ! [L,M] :
( convergent_lines(L,M)
| ~ unequally_directed_lines(L,M)
| ~ unequally_directed_lines(L,reverse_line(M)) ) ),
inference(miniscoping,[status(esa)],[f39]) ).
fof(f41,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f42,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f90,plain,
! [L,M] :
( ~ unequally_directed_lines(L,M)
| ~ unequally_directed_lines(L,reverse_line(M))
| left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
inference(pre_NNF_transformation,[status(esa)],[f14]) ).
fof(f91,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[status(esa)],[f90]) ).
fof(f96,plain,
! [L,M] :
( ~ left_convergent_lines(L,M)
& ~ left_convergent_lines(L,reverse_line(M)) ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f97,plain,
( ! [L,M] : ~ left_convergent_lines(L,M)
& ! [L,M] : ~ left_convergent_lines(L,reverse_line(M)) ),
inference(miniscoping,[status(esa)],[f96]) ).
fof(f98,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[status(esa)],[f97]) ).
fof(f130,plain,
? [L,M,A,B,C] :
( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& ~ apart_point_and_line(B,M)
& ~ divides_points(M,A,C) ),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f131,plain,
? [M,A,C] :
( ? [B] :
( ? [L] :
( between_on_line(L,A,B,C)
& convergent_lines(L,M) )
& ~ apart_point_and_line(B,M) )
& ~ divides_points(M,A,C) ),
inference(miniscoping,[status(esa)],[f130]) ).
fof(f132,plain,
( between_on_line(sk0_4,sk0_1,sk0_3,sk0_2)
& convergent_lines(sk0_4,sk0_0)
& ~ apart_point_and_line(sk0_3,sk0_0)
& ~ divides_points(sk0_0,sk0_1,sk0_2) ),
inference(skolemization,[status(esa)],[f131]) ).
fof(f134,plain,
convergent_lines(sk0_4,sk0_0),
inference(cnf_transformation,[status(esa)],[f132]) ).
fof(f150,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,reverse_line(X1)) ),
inference(backward_subsumption_resolution,[status(thm)],[f91,f98]) ).
fof(f151,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[f150,f98]) ).
fof(f167,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(resolution,[status(thm)],[f151,f42]) ).
fof(f168,plain,
! [X0,X1] : ~ convergent_lines(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[f167,f41]) ).
fof(f169,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f134,f168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO261+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.32 % Computer : n013.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 300
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Tue May 30 11:55:50 EDT 2023
% 0.09/0.32 % CPUTime :
% 0.09/0.33 % Drodi V3.5.1
% 0.09/0.34 % Refutation found
% 0.09/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.56 % Elapsed time: 0.014100 seconds
% 0.15/0.56 % CPU time: 0.012848 seconds
% 0.15/0.56 % Memory used: 620.105 KB
%------------------------------------------------------------------------------