%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO057-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:56 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-4 aty)
% Number of variables : 13 ( 2 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(reflection,axiom,
! [VAR_0,VAR_1] : reflection(VAR_0,VAR_1) = extension(VAR_0,VAR_1,VAR_0,VAR_1),
file('theBenchmark.p',reflection) ).
cnf(c_19,plain,
reflection(A,B) = extension(A,B,A,B),
inference(clausify,[status(thm)],[reflection]) ).
fof(e1,axiom,
! [VAR_0,VAR_1,VAR_2] : VAR_0 = extension(VAR_1,VAR_0,VAR_2,VAR_2),
file('theBenchmark.p',e1) ).
cnf(c_29,plain,
A = extension(B,A,C,C),
inference(clausify,[status(thm)],[e1]) ).
cnf(c_30,plain,
extension(A,B,C,C) = B,
inference(copy,[status(thm)],[c_29]) ).
fof(prove_null_extension_by_reflection,axiom,
u != reflection(u,u),
file('theBenchmark.p',prove_null_extension_by_reflection) ).
cnf(c_35,plain,
u != reflection(u,u),
inference(clausify,[status(thm)],[prove_null_extension_by_reflection]) ).
cnf(c_37,plain,
u != extension(u,u,u,u),
inference(paramod,[status(thm)],[c_19,c_35]) ).
cnf(c_38,plain,
u != u,
inference(paramod,[status(thm)],[c_30,c_37]) ).
cnf(c_36,plain,
$false,
inference(copy,[status(thm)],[c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO057-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n026.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Fri Sep 25 12:40:24 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 2527167 was started by sandbox2 on n026,
% 0.18/0.44 % Fri Sep 25 12:40:24 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.45
% 0.18/0.45 % From the command line: assign(max_seconds, 300).
% 0.18/0.46
% 0.18/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46
% 0.18/0.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.46 % Length of proof is 5.
% 0.18/0.46 % Level of proof is 2.
% 0.18/0.46 % Maximum clause weight is 9.000.
% 0.18/0.46 % Given clauses 0.
% 0.18/0.46
% 0.18/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------