%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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 : Tue Sep 29 12:09:50 PM UTC 2026
% Result : Unsatisfiable 0.03s 0.46s
% Output : Proof 0.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n001.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.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Sun Sep 27 18:46:01 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.46 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.03/0.46
% 0.03/0.46 % SZS status Unsatisfiable
% 0.03/0.46
% 0.03/0.46 % SZS output start Proof
% 0.03/0.46 Axiom 1 (a_less_than_b): less(a, b) = true.
% 0.03/0.46 Axiom 2 (prove_b_not_less_than_a): less(b, a) = true.
% 0.03/0.46 Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.03/0.46 Axiom 4 (transitivity_of_less): ifeq(less(X, Y), true, ifeq(less(Y, Z), true, less(X, Z), true), true) = true.
% 0.03/0.46
% 0.03/0.46 Goal 1 (no_number_less_than_itself): less(X, X) = true.
% 0.03/0.46 The goal is true when:
% 0.03/0.46 X = a
% 0.03/0.46
% 0.03/0.46 Proof:
% 0.03/0.46 less(a, a)
% 0.03/0.46 = { by axiom 3 (ifeq_axiom) R->L }
% 0.03/0.46 ifeq(true, true, less(a, a), true)
% 0.03/0.46 = { by axiom 2 (prove_b_not_less_than_a) R->L }
% 0.03/0.46 ifeq(less(b, a), true, less(a, a), true)
% 0.03/0.46 = { by axiom 3 (ifeq_axiom) R->L }
% 0.03/0.46 ifeq(true, true, ifeq(less(b, a), true, less(a, a), true), true)
% 0.03/0.46 = { by axiom 1 (a_less_than_b) R->L }
% 0.03/0.46 ifeq(less(a, b), true, ifeq(less(b, a), true, less(a, a), true), true)
% 0.03/0.46 = { by axiom 4 (transitivity_of_less) }
% 0.03/0.46 true
% 0.03/0.46 % SZS output end Proof
% 0.03/0.46
% 0.03/0.46 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------