%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD056-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:11:38 AM UTC 2026
% Result : Unsatisfiable 0.14s 10.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 6 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(totality_of_order_relation,axiom,
! [VAR_0,VAR_1] :
( ~ defined(VAR_1)
| ~ defined(VAR_0)
| less_or_equal(VAR_1,VAR_0)
| less_or_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',totality_of_order_relation) ).
cnf(c_18,plain,
( ~ defined(B)
| ~ defined(A)
| less_or_equal(B,A)
| less_or_equal(A,B) ),
inference(clausify,[status(thm)],[totality_of_order_relation]) ).
fof(a_is_defined,axiom,
defined(a),
file('theBenchmark.p',a_is_defined) ).
cnf(c_28,plain,
defined(a),
inference(clausify,[status(thm)],[a_is_defined]) ).
fof(not_less_or_equal_2,axiom,
~ less_or_equal(a,a),
file('theBenchmark.p',not_less_or_equal_2) ).
cnf(c_29,plain,
~ less_or_equal(a,a),
inference(clausify,[status(thm)],[not_less_or_equal_2]) ).
cnf(c_123,plain,
( ~ defined(A)
| less_or_equal(a,A)
| less_or_equal(A,a) ),
inference(resolve,[status(thm)],[c_28,c_18]) ).
cnf(c_148,plain,
( ~ defined(a)
| less_or_equal(a,a) ),
inference(factor,[status(thm)],[c_123]) ).
cnf(c_149,plain,
~ defined(a),
inference(resolve,[status(thm)],[c_29,c_148]) ).
cnf(c_147,plain,
$false,
inference(resolve,[status(thm)],[c_28,c_149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD056-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.38 % Computer : n019.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Sun Sep 27 02:32:29 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.11/10.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/10.38 % Process 2724377 was started by sandbox on n019,
% 0.11/10.38 % Sun Sep 27 02:32:29 2026
% 0.11/10.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/10.39
% 0.11/10.39 % From the command line: assign(max_seconds, 300).
% 0.14/10.40
% 0.14/10.40 % SZS status Unsatisfiable for theBenchmark
% 0.14/10.40
% 0.14/10.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.14/10.40 % Length of proof is 5.
% 0.14/10.40 % Level of proof is 2.
% 0.14/10.40 % Maximum clause weight is 10.000.
% 0.14/10.40 % Given clauses 28.
% 0.14/10.40
% 0.14/10.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------