%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SYN068-1 : TPTP v9.3.1. Released v1.0.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:47:01 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.23s
% Output : Proof 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN068-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.16 % Computer : n006.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Mon Sep 28 15:28:24 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.23 Command-line arguments: --flatten --complete-subsets
% 0.10/0.23
% 0.10/0.23 % SZS status Unsatisfiable
% 0.10/0.23
% 0.10/0.23 % SZS output start Proof
% 0.10/0.23 Axiom 1 (clause_5): big_j(a) = true.
% 0.10/0.23 Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.10/0.23 Axiom 3 (clause_7): ifeq(big_j(X), true, big_f(X), true) = true.
% 0.10/0.23 Axiom 4 (clause_3): ifeq(big_f(X), true, big_g(g(X)), true) = true.
% 0.10/0.24 Axiom 5 (clause_6): ifeq(big_g(X), true, big_h(a, X), true) = true.
% 0.10/0.24
% 0.10/0.24 Lemma 6: big_j(a) = big_f(a).
% 0.10/0.24 Proof:
% 0.10/0.24 big_j(a)
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 true
% 0.10/0.24 = { by axiom 3 (clause_7) R->L }
% 0.10/0.24 ifeq(big_j(a), true, big_f(a), true)
% 0.10/0.24 = { by axiom 1 (clause_5) R->L }
% 0.10/0.24 ifeq(big_j(a), true, big_f(a), big_j(a))
% 0.10/0.24 = { by axiom 1 (clause_5) R->L }
% 0.10/0.24 ifeq(big_j(a), big_j(a), big_f(a), big_j(a))
% 0.10/0.24 = { by axiom 2 (ifeq_axiom) }
% 0.10/0.24 big_f(a)
% 0.10/0.24
% 0.10/0.24 Goal 1 (clause_4): tuple(big_f(X), big_h(X, g(X))) = tuple(true, true).
% 0.10/0.24 The goal is true when:
% 0.10/0.24 X = a
% 0.10/0.24
% 0.10/0.24 Proof:
% 0.10/0.24 tuple(big_f(a), big_h(a, g(a)))
% 0.10/0.24 = { by axiom 2 (ifeq_axiom) R->L }
% 0.10/0.24 tuple(big_f(a), ifeq(big_j(a), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 tuple(big_f(a), ifeq(true, big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 4 (clause_3) R->L }
% 0.10/0.24 tuple(big_f(a), ifeq(ifeq(big_f(a), true, big_g(g(a)), true), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 1 (clause_5) R->L }
% 0.10/0.24 tuple(big_f(a), ifeq(ifeq(big_f(a), true, big_g(g(a)), big_j(a)), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 1 (clause_5) R->L }
% 0.10/0.24 tuple(big_f(a), ifeq(ifeq(big_f(a), big_j(a), big_g(g(a)), big_j(a)), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by lemma 6 R->L }
% 0.10/0.24 tuple(big_f(a), ifeq(ifeq(big_j(a), big_j(a), big_g(g(a)), big_j(a)), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 2 (ifeq_axiom) }
% 0.10/0.24 tuple(big_f(a), ifeq(big_g(g(a)), big_j(a), big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 tuple(big_f(a), ifeq(big_g(g(a)), true, big_h(a, g(a)), big_j(a)))
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 tuple(big_f(a), ifeq(big_g(g(a)), true, big_h(a, g(a)), true))
% 0.10/0.24 = { by axiom 5 (clause_6) }
% 0.10/0.24 tuple(big_f(a), true)
% 0.10/0.24 = { by axiom 1 (clause_5) R->L }
% 0.10/0.24 tuple(big_f(a), big_j(a))
% 0.10/0.24 = { by lemma 6 R->L }
% 0.10/0.24 tuple(big_j(a), big_j(a))
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 tuple(true, big_j(a))
% 0.10/0.24 = { by axiom 1 (clause_5) }
% 0.10/0.24 tuple(true, true)
% 0.10/0.24 % SZS output end Proof
% 0.10/0.24
% 0.10/0.24 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------