%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SWV254-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n006.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 01:06:34 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.24s
% Output : Proof 0.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV254-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.16 % Computer : n006.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Mon Sep 28 10:18:55 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.24 Command-line arguments: --no-flatten-goal
% 0.08/0.24
% 0.08/0.24 % SZS status Unsatisfiable
% 0.08/0.24
% 0.08/0.24 % SZS output start Proof
% 0.08/0.24 Axiom 1 (cls_conjecture_1): v_x(X) = v_nat.
% 0.08/0.24 Axiom 2 (clsarity_nat_3): class_Orderings_Oorder(tc_nat) = true.
% 0.08/0.24 Axiom 3 (cls_conjecture_0): c_lessequals(X, v_x(X), tc_nat) = true.
% 0.08/0.24 Axiom 4 (cls_SetInterval_OatLeastLessThan__singleton_0): c_SetInterval_OatLeastLessThan(X, c_Suc(X), tc_nat) = c_insert(X, c_emptyset, tc_nat).
% 0.08/0.24 Axiom 5 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.08/0.24 Axiom 6 (cls_SetInterval_OatLeastLessThan__empty_0): ifeq(c_lessequals(X, Y, Z), true, ifeq(class_Orderings_Oorder(Z), true, c_SetInterval_OatLeastLessThan(Y, X, Z), c_emptyset), c_emptyset) = c_emptyset.
% 0.08/0.24
% 0.08/0.24 Goal 1 (cls_Set_Oempty__not__insert_0): c_emptyset = c_insert(X, Y, Z).
% 0.08/0.24 The goal is true when:
% 0.08/0.24 X = v_nat
% 0.08/0.24 Y = c_emptyset
% 0.08/0.24 Z = tc_nat
% 0.08/0.24
% 0.08/0.24 Proof:
% 0.08/0.24 c_emptyset
% 0.08/0.24 = { by axiom 6 (cls_SetInterval_OatLeastLessThan__empty_0) R->L }
% 0.08/0.24 ifeq(c_lessequals(c_Suc(v_nat), v_nat, tc_nat), true, ifeq(class_Orderings_Oorder(tc_nat), true, c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat), c_emptyset), c_emptyset)
% 0.08/0.24 = { by axiom 1 (cls_conjecture_1) R->L }
% 0.08/0.24 ifeq(c_lessequals(c_Suc(v_nat), v_x(c_Suc(v_nat)), tc_nat), true, ifeq(class_Orderings_Oorder(tc_nat), true, c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat), c_emptyset), c_emptyset)
% 0.08/0.24 = { by axiom 3 (cls_conjecture_0) }
% 0.08/0.24 ifeq(true, true, ifeq(class_Orderings_Oorder(tc_nat), true, c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat), c_emptyset), c_emptyset)
% 0.08/0.24 = { by axiom 5 (ifeq_axiom) }
% 0.08/0.24 ifeq(class_Orderings_Oorder(tc_nat), true, c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat), c_emptyset)
% 0.08/0.24 = { by axiom 2 (clsarity_nat_3) }
% 0.08/0.24 ifeq(true, true, c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat), c_emptyset)
% 0.08/0.24 = { by axiom 5 (ifeq_axiom) }
% 0.08/0.24 c_SetInterval_OatLeastLessThan(v_nat, c_Suc(v_nat), tc_nat)
% 0.08/0.24 = { by axiom 4 (cls_SetInterval_OatLeastLessThan__singleton_0) }
% 0.08/0.24 c_insert(v_nat, c_emptyset, tc_nat)
% 0.08/0.24 % SZS output end Proof
% 0.08/0.24
% 0.08/0.24 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------