%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SET855-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n013.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:39:15 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Proof 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET855-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 03:00:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.45 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.10/0.45
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45
% 0.10/0.45 % SZS output start Proof
% 0.10/0.45 Axiom 1 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.10/0.45 Axiom 2 (cls_conjecture_2): c_lessequals(v_n, c_Union(v_Y, tc_set(t_a)), tc_set(tc_set(t_a))) = true.
% 0.10/0.45 Axiom 3 (cls_conjecture_3): c_lessequals(c_Union(v_Y, tc_set(t_a)), v_n, tc_set(tc_set(t_a))) = true.
% 0.10/0.45 Axiom 4 (cls_Set_Osubset__antisym_0): ifeq(c_lessequals(X, Y, tc_set(Z)), true, ifeq(c_lessequals(Y, X, tc_set(Z)), true, X, Y), Y) = Y.
% 0.10/0.45
% 0.10/0.45 Goal 1 (cls_conjecture_4): v_n = c_Union(v_Y, tc_set(t_a)).
% 0.10/0.45 Proof:
% 0.10/0.45 v_n
% 0.10/0.45 = { by axiom 1 (ifeq_axiom) R->L }
% 0.10/0.45 ifeq(true, true, v_n, c_Union(v_Y, tc_set(t_a)))
% 0.10/0.45 = { by axiom 3 (cls_conjecture_3) R->L }
% 0.10/0.45 ifeq(c_lessequals(c_Union(v_Y, tc_set(t_a)), v_n, tc_set(tc_set(t_a))), true, v_n, c_Union(v_Y, tc_set(t_a)))
% 0.10/0.45 = { by axiom 1 (ifeq_axiom) R->L }
% 0.10/0.45 ifeq(true, true, ifeq(c_lessequals(c_Union(v_Y, tc_set(t_a)), v_n, tc_set(tc_set(t_a))), true, v_n, c_Union(v_Y, tc_set(t_a))), c_Union(v_Y, tc_set(t_a)))
% 0.10/0.45 = { by axiom 2 (cls_conjecture_2) R->L }
% 0.10/0.45 ifeq(c_lessequals(v_n, c_Union(v_Y, tc_set(t_a)), tc_set(tc_set(t_a))), true, ifeq(c_lessequals(c_Union(v_Y, tc_set(t_a)), v_n, tc_set(tc_set(t_a))), true, v_n, c_Union(v_Y, tc_set(t_a))), c_Union(v_Y, tc_set(t_a)))
% 0.10/0.45 = { by axiom 4 (cls_Set_Osubset__antisym_0) }
% 0.10/0.45 c_Union(v_Y, tc_set(t_a))
% 0.10/0.45 % SZS output end Proof
% 0.10/0.45
% 0.10/0.45 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------