↑ Up

Twee---2.7.UNS-Prf.s

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

% Computer : n002.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:45:34 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX207-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.18  % Computer : n002.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 15:10:51 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.17/0.43  Command-line arguments: --no-flatten-goal
% 1.17/0.43  
% 1.17/0.43  % SZS status Unsatisfiable
% 1.17/0.43  
% 1.17/0.44  % SZS output start Proof
% 1.17/0.44  Axiom 1 (axiom_008): linP(pE) = nil.
% 1.17/0.44  Axiom 2 (axiom): impl(btrue, X) = X.
% 1.17/0.44  Axiom 3 (axiom_043): eq5(X, X) = btrue.
% 1.17/0.44  Axiom 4 (axiom_002): append(nil, X) = X.
% 1.17/0.44  Axiom 5 (axiom_039): eq(X, X) = btrue.
% 1.17/0.44  Axiom 6 (axiom_006): linP(pA) = cons(a, nil).
% 1.17/0.44  Axiom 7 (axiom_014): eq3(pA, pE) = bfalse.
% 1.17/0.44  Axiom 8 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 1.17/0.44  Axiom 9 (axiom_009): linC(c2(X, Y)) = append(linP(X), linP(Y)).
% 1.17/0.44  Axiom 10 (axiom_003): append(cons(X, Y), Z) = cons(X, append(Y, Z)).
% 1.17/0.44  Axiom 11 (axiom_010): unambig(X, Y) = impl(eq(linC(X), linC(Y)), eq4(X, Y)).
% 1.17/0.44  Axiom 12 (axiom_037): ifeq(eq3(X, Y), bfalse, eq4(c2(X, Z), c2(Y, W)), bfalse) = bfalse.
% 1.17/0.44  
% 1.17/0.44  Goal 1 (goal): eq5(unambig(X, Y), bfalse) = btrue.
% 1.17/0.44  The goal is true when:
% 1.17/0.44    X = c2(pA, pE)
% 1.17/0.44    Y = c2(pE, pA)
% 1.17/0.44  
% 1.17/0.44  Proof:
% 1.17/0.44    eq5(unambig(c2(pA, pE), c2(pE, pA)), bfalse)
% 1.17/0.44  = { by axiom 11 (axiom_010) }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), linC(c2(pE, pA))), eq4(c2(pA, pE), c2(pE, pA))), bfalse)
% 1.17/0.44  = { by axiom 8 (ifeq_axiom) R->L }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), linC(c2(pE, pA))), ifeq(bfalse, bfalse, eq4(c2(pA, pE), c2(pE, pA)), bfalse)), bfalse)
% 1.17/0.44  = { by axiom 7 (axiom_014) R->L }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), linC(c2(pE, pA))), ifeq(eq3(pA, pE), bfalse, eq4(c2(pA, pE), c2(pE, pA)), bfalse)), bfalse)
% 1.17/0.44  = { by axiom 12 (axiom_037) }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), linC(c2(pE, pA))), bfalse), bfalse)
% 1.17/0.44  = { by axiom 9 (axiom_009) }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), append(linP(pE), linP(pA))), bfalse), bfalse)
% 1.17/0.44  = { by axiom 1 (axiom_008) }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), append(nil, linP(pA))), bfalse), bfalse)
% 1.17/0.44  = { by axiom 4 (axiom_002) }
% 1.17/0.44    eq5(impl(eq(linC(c2(pA, pE)), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 9 (axiom_009) }
% 1.17/0.44    eq5(impl(eq(append(linP(pA), linP(pE)), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 1 (axiom_008) }
% 1.17/0.44    eq5(impl(eq(append(linP(pA), nil), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 6 (axiom_006) }
% 1.17/0.44    eq5(impl(eq(append(cons(a, nil), nil), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 10 (axiom_003) }
% 1.17/0.44    eq5(impl(eq(cons(a, append(nil, nil)), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 4 (axiom_002) }
% 1.17/0.44    eq5(impl(eq(cons(a, nil), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 6 (axiom_006) R->L }
% 1.17/0.44    eq5(impl(eq(linP(pA), linP(pA)), bfalse), bfalse)
% 1.17/0.44  = { by axiom 5 (axiom_039) }
% 1.17/0.44    eq5(impl(btrue, bfalse), bfalse)
% 1.17/0.44  = { by axiom 2 (axiom) }
% 1.17/0.44    eq5(bfalse, bfalse)
% 1.17/0.44  = { by axiom 3 (axiom_043) }
% 1.17/0.44    btrue
% 1.17/0.44  % SZS output end Proof
% 1.17/0.44  
% 1.17/0.44  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------