↑ Up

Twee---2.7.UNS-Prf.s

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

% Computer : n007.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:11 PM UTC 2026

% Result   : Unsatisfiable 3.20s 0.64s
% Output   : Proof 3.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN149-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.16  % Computer : n007.cluster.edu
% 0.09/0.16  % Model    : x86_64 x86_64
% 0.09/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16  % Memory   : 8046.5625MB
% 0.09/0.16  % OS       : Linux 6.8.0-71-generic
% 0.09/0.16  % CPULimit : 300
% 0.09/0.16  % WCLimit  : 300
% 0.09/0.16  % DateTime : Mon Sep 28 15:34:55 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.20/0.64  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-regeneralise
% 3.20/0.64  
% 3.20/0.64  % SZS status Unsatisfiable
% 3.20/0.64  
% 3.20/0.64  % SZS output start Proof
% 3.20/0.64  Axiom 1 (axiom_19): m0(X, d, Y) = true.
% 3.20/0.64  Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 3.20/0.64  Axiom 3 (rule_036): ifeq(m0(b, X, Y), true, n1(Y, Y, X), true) = true.
% 3.20/0.64  
% 3.20/0.64  Goal 1 (prove_this): n1(e, e, X) = true.
% 3.20/0.64  The goal is true when:
% 3.20/0.64    X = d
% 3.20/0.64  
% 3.20/0.64  Proof:
% 3.20/0.64    n1(e, e, d)
% 3.20/0.64  = { by axiom 2 (ifeq_axiom) R->L }
% 3.20/0.64    ifeq(true, true, n1(e, e, d), true)
% 3.20/0.64  = { by axiom 1 (axiom_19) R->L }
% 3.20/0.64    ifeq(m0(b, d, e), true, n1(e, e, d), true)
% 3.20/0.64  = { by axiom 3 (rule_036) }
% 3.20/0.64    true
% 3.20/0.64  % SZS output end Proof
% 3.20/0.64  
% 3.20/0.64  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------