↑ Up

Twee---2.7.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : HEN005-5 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox2/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 10:18:57 AM UTC 2026

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN005-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 10:53:05 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.46  
% 0.19/0.46  % SZS status Unsatisfiable
% 0.19/0.46  
% 0.19/0.46  % SZS output start Proof
% 0.19/0.46  Axiom 1 (zero_is_smallest): divide(zero, X) = zero.
% 0.19/0.46  Axiom 2 (a_divide_b_is_zero): divide(a, b) = zero.
% 0.19/0.46  Axiom 3 (b_divide_c_is_zero): divide(b, c) = zero.
% 0.19/0.46  Axiom 4 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.19/0.46  Axiom 5 (quotient_property): divide(divide(divide(X, Y), divide(Z, Y)), divide(divide(X, Z), Y)) = zero.
% 0.19/0.47  Axiom 6 (divide_and_equal): ifeq(divide(X, Y), zero, ifeq(divide(Y, X), zero, Y, X), X) = X.
% 0.19/0.47  
% 0.19/0.47  Goal 1 (prove_transitivity_of_divide_to_zero): divide(a, c) = zero.
% 0.19/0.47  Proof:
% 0.19/0.47    divide(a, c)
% 0.19/0.47  = { by axiom 6 (divide_and_equal) R->L }
% 0.19/0.47    ifeq(divide(divide(a, c), zero), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 6 (divide_and_equal) R->L }
% 0.19/0.47    ifeq(ifeq(divide(divide(divide(a, c), zero), zero), zero, ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 3 (b_divide_c_is_zero) R->L }
% 0.19/0.47    ifeq(ifeq(divide(divide(divide(a, c), divide(b, c)), zero), zero, ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 1 (zero_is_smallest) R->L }
% 0.19/0.47    ifeq(ifeq(divide(divide(divide(a, c), divide(b, c)), divide(zero, c)), zero, ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 2 (a_divide_b_is_zero) R->L }
% 0.19/0.47    ifeq(ifeq(divide(divide(divide(a, c), divide(b, c)), divide(divide(a, b), c)), zero, ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 5 (quotient_property) }
% 0.19/0.47    ifeq(ifeq(zero, zero, ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 4 (ifeq_axiom) }
% 0.19/0.47    ifeq(ifeq(divide(zero, divide(divide(a, c), zero)), zero, zero, divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 1 (zero_is_smallest) }
% 0.19/0.47    ifeq(ifeq(zero, zero, zero, divide(divide(a, c), zero)), zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 4 (ifeq_axiom) }
% 0.19/0.47    ifeq(zero, zero, ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c)), divide(a, c))
% 0.19/0.47  = { by axiom 4 (ifeq_axiom) }
% 0.19/0.47    ifeq(divide(zero, divide(a, c)), zero, zero, divide(a, c))
% 0.19/0.47  = { by axiom 1 (zero_is_smallest) }
% 0.19/0.47    ifeq(zero, zero, zero, divide(a, c))
% 0.19/0.47  = { by axiom 4 (ifeq_axiom) }
% 0.19/0.47    zero
% 0.19/0.47  % SZS output end Proof
% 0.19/0.47  
% 0.19/0.47  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------