%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO035-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:16:51 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 8 unt; 0 def)
% Number of atoms : 12 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 20 ( 3 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(identity_for_equidistance,axiom,
! [VAR_0,VAR_1,VAR_2] :
( VAR_0 = VAR_1
| ~ equidistant(VAR_0,VAR_1,VAR_2,VAR_2) ),
file('theBenchmark.p',identity_for_equidistance) ).
cnf(c_3,plain,
( A = B
| ~ equidistant(A,B,C,C) ),
inference(clausify,[status(thm)],[identity_for_equidistance]) ).
fof(segment_construction2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] : equidistant(VAR_0,extension(VAR_1,VAR_0,VAR_2,VAR_3),VAR_2,VAR_3),
file('theBenchmark.p',segment_construction2) ).
cnf(c_5,plain,
equidistant(A,extension(B,A,C,D),C,D),
inference(clausify,[status(thm)],[segment_construction2]) ).
fof(prove_null_extension,axiom,
v != extension(u,v,w,w),
file('theBenchmark.p',prove_null_extension) ).
cnf(c_28,plain,
v != extension(u,v,w,w),
inference(clausify,[status(thm)],[prove_null_extension]) ).
cnf(c_29,plain,
extension(u,v,w,w) != v,
inference(copy,[status(thm)],[c_28]) ).
cnf(c_46,plain,
A = extension(B,A,C,C),
inference(resolve,[status(thm)],[c_5,c_3]) ).
cnf(c_44,plain,
extension(A,B,C,C) = B,
inference(copy,[status(thm)],[c_46]) ).
cnf(c_45,plain,
$false,
inference(resolve,[status(thm)],[c_44,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO035-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n018.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 12:36:50 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 1960158 was started by sandbox on n018,
% 0.08/0.36 % Fri Sep 25 12:36:50 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.08/0.38
% 0.08/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.38
% 0.08/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.38 % Length of proof is 6.
% 0.08/0.38 % Level of proof is 2.
% 0.08/0.38 % Maximum clause weight is 9.000.
% 0.08/0.38 % Given clauses 5.
% 0.08/0.38
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------