%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO261+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:17:45 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 44 ( 18 ~; 10 |; 12 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 33 ( 2 sgn 16 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con_def,axiom,
! [L,M] :
( convergent_lines(L,M)
<=> ( unequally_directed_lines(L,reverse_line(M))
& unequally_directed_lines(L,M) ) ),
file('theBenchmark.p',con_def) ).
fof(oag9,axiom,
! [L,M] :
( ( unequally_directed_lines(L,reverse_line(M))
& unequally_directed_lines(L,M) )
=> ( left_convergent_lines(L,reverse_line(M))
| left_convergent_lines(L,M) ) ),
file('theBenchmark.p',oag9) ).
fof(oag11,axiom,
! [L,M] :
~ ( left_convergent_lines(L,reverse_line(M))
| left_convergent_lines(L,M) ),
file('theBenchmark.p',oag11) ).
fof(con,conjecture,
! [L,M,A,B,C] :
( ( ~ apart_point_and_line(B,M)
& convergent_lines(L,M)
& between_on_line(L,A,B,C) )
=> divides_points(M,A,C) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [L,M,A,B,C] :
( ( ~ apart_point_and_line(B,M)
& convergent_lines(L,M)
& between_on_line(L,A,B,C) )
=> divides_points(M,A,C) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_42,plain,
( unequally_directed_lines(A,reverse_line(B))
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[con_def]) ).
fof(nnf_32,plain,
? [L,M,A,B,C] :
( ~ divides_points(M,A,C)
& ~ apart_point_and_line(B,M)
& convergent_lines(L,M)
& between_on_line(L,A,B,C) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ divides_points(sK1,sK2,sK4)
& ~ apart_point_and_line(sK3,sK1)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK2,sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK2,sK3,sK4,sK1]),skolemize(L,sK0),skolemize(M,sK1),skolemize(A,sK2),skolemize(B,sK3),skolemize(C,sK4)],[nnf_32]) ).
cnf(c_44,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_45,plain,
( unequally_directed_lines(A,B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[con_def]) ).
cnf(c_64,negated_conjecture,
unequally_directed_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_45,c_44]) ).
cnf(c_65,negated_conjecture,
unequally_directed_lines(sK0,reverse_line(sK1)),
inference(resolve,[status(thm)],[c_42,c_44]) ).
cnf(c_82,plain,
( left_convergent_lines(A,reverse_line(B))
| left_convergent_lines(A,B)
| ~ unequally_directed_lines(A,reverse_line(B))
| ~ unequally_directed_lines(A,B) ),
inference(clausify,[status(thm)],[oag9]) ).
cnf(c_84,plain,
~ left_convergent_lines(A,B),
inference(clausify,[status(thm)],[oag11]) ).
cnf(c_120,plain,
( left_convergent_lines(A,reverse_line(B))
| ~ unequally_directed_lines(A,reverse_line(B))
| ~ unequally_directed_lines(A,B) ),
inference(resolve,[status(thm)],[c_84,c_82]) ).
cnf(c_100,plain,
( ~ unequally_directed_lines(A,reverse_line(B))
| ~ unequally_directed_lines(A,B) ),
inference(resolve,[status(thm)],[c_84,c_120]) ).
cnf(c_121,negated_conjecture,
~ unequally_directed_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_100,c_65]) ).
cnf(c_119,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_64,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO261+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 13:11:07 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 3241560 was started by sandbox2 on n004,
% 0.10/0.37 % Fri Sep 25 13:11:07 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 13.
% 0.10/0.39 % Level of proof is 3.
% 0.10/0.39 % Maximum clause weight is 14.000.
% 0.10/0.39 % Given clauses 27.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------