↑ Up

Twee---2.7.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : SET844-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n015.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:14 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.43s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET844-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n015.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 28 03:03:01 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.43  Command-line arguments: --no-flatten-goal
% 0.10/0.43  
% 0.10/0.43  % SZS status Unsatisfiable
% 0.10/0.43  
% 0.10/0.43  % SZS output start Proof
% 0.10/0.44  Axiom 1 (cls_conjecture_1): v_m = c_Zorn_Osucc(v_S, v_m, t_a).
% 0.10/0.44  Axiom 2 (cls_Set_Osubset__refl_0): c_lessequals(X, X, tc_set(Y)) = true.
% 0.10/0.44  Axiom 3 (ifeq_axiom): ifeq2(X, X, Y, Z) = Y.
% 0.10/0.44  Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.10/0.44  Axiom 5 (cls_conjecture_0): c_in(v_m, c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))) = true.
% 0.10/0.44  Axiom 6 (cls_Zorn_OTFin__UnionI_0): ifeq(c_lessequals(X, c_Zorn_OTFin(Y, Z), tc_set(tc_set(tc_set(Z)))), true, c_in(c_Union(X, tc_set(Z)), c_Zorn_OTFin(Y, Z), tc_set(tc_set(Z))), true) = true.
% 0.10/0.44  Axiom 7 (cls_Zorn_Oeq__succ__upper_0): ifeq(c_in(X, c_Zorn_OTFin(Y, Z), tc_set(tc_set(Z))), true, ifeq(c_in(W, c_Zorn_OTFin(Y, Z), tc_set(tc_set(Z))), true, ifeq2(W, c_Zorn_Osucc(Y, W, Z), c_lessequals(X, W, tc_set(tc_set(Z))), true), true), true) = true.
% 0.10/0.44  
% 0.10/0.44  Goal 1 (cls_conjecture_2): c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))) = true.
% 0.10/0.44  Proof:
% 0.10/0.44    c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a)))
% 0.10/0.44  = { by axiom 4 (ifeq_axiom) R->L }
% 0.10/0.44    ifeq(true, true, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true)
% 0.10/0.44  = { by axiom 6 (cls_Zorn_OTFin__UnionI_0) R->L }
% 0.10/0.44    ifeq(ifeq(c_lessequals(c_Zorn_OTFin(v_S, t_a), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(tc_set(t_a)))), true, c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true), true, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true)
% 0.10/0.44  = { by axiom 2 (cls_Set_Osubset__refl_0) }
% 0.10/0.44    ifeq(ifeq(true, true, c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true), true, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true)
% 0.10/0.44  = { by axiom 4 (ifeq_axiom) }
% 0.10/0.44    ifeq(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true)
% 0.10/0.44  = { by axiom 3 (ifeq_axiom) R->L }
% 0.10/0.44    ifeq(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq2(v_m, v_m, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true), true)
% 0.10/0.44  = { by axiom 4 (ifeq_axiom) R->L }
% 0.10/0.44    ifeq(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq(true, true, ifeq2(v_m, v_m, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true), true), true)
% 0.10/0.44  = { by axiom 5 (cls_conjecture_0) R->L }
% 0.10/0.44    ifeq(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq(c_in(v_m, c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq2(v_m, v_m, c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true), true), true)
% 0.10/0.44  = { by axiom 1 (cls_conjecture_1) }
% 0.10/0.44    ifeq(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq(c_in(v_m, c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true, ifeq2(v_m, c_Zorn_Osucc(v_S, v_m, t_a), c_lessequals(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), v_m, tc_set(tc_set(t_a))), true), true), true)
% 0.10/0.44  = { by axiom 7 (cls_Zorn_Oeq__succ__upper_0) }
% 0.10/0.44    true
% 0.10/0.44  % SZS output end Proof
% 0.10/0.44  
% 0.10/0.44  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------