↑ Up

Twee---2.7.THM-Prf.s

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

% Computer : n020.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:48:19 PM UTC 2026

% Result   : Theorem 0.11s 0.23s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN721+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.16  % Computer : n020.cluster.edu
% 0.11/0.16  % Model    : x86_64 x86_64
% 0.11/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16  % Memory   : 8046.5625MB
% 0.11/0.16  % OS       : Linux 6.8.0-71-generic
% 0.11/0.16  % CPULimit : 300
% 0.11/0.16  % WCLimit  : 300
% 0.11/0.16  % DateTime : Mon Sep 28 16:49:49 UTC 2026
% 0.11/0.16  % CPUTime  : 
% 0.11/0.16  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.23  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
% 0.11/0.23  
% 0.11/0.23  % SZS status Theorem
% 0.11/0.23  
% 0.11/0.23  % SZS output start Proof
% 0.11/0.23  Axiom 1 (lx1): r(a, b) = true.
% 0.11/0.23  Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.11/0.23  Axiom 3 (lx1_1): ifeq(r(X, Y), true, q(X, X), true) = true.
% 0.11/0.23  Axiom 4 (lx1_3): ifeq(q(X, Y), true, r(Z, Y), true) = true.
% 0.11/0.23  
% 0.11/0.23  Goal 1 (lx1_2): tuple(r(b, X), q(X, a)) = tuple(true, true).
% 0.11/0.23  The goal is true when:
% 0.11/0.23    X = a
% 0.11/0.23  
% 0.11/0.23  Proof:
% 0.11/0.23    tuple(r(b, a), q(a, a))
% 0.11/0.23  = { by axiom 2 (ifeq_axiom) R->L }
% 0.11/0.23    tuple(ifeq(true, true, r(b, a), true), q(a, a))
% 0.11/0.23  = { by axiom 3 (lx1_1) R->L }
% 0.11/0.23    tuple(ifeq(ifeq(r(a, b), true, q(a, a), true), true, r(b, a), true), q(a, a))
% 0.11/0.23  = { by axiom 1 (lx1) }
% 0.11/0.23    tuple(ifeq(ifeq(true, true, q(a, a), true), true, r(b, a), true), q(a, a))
% 0.11/0.23  = { by axiom 2 (ifeq_axiom) }
% 0.11/0.23    tuple(ifeq(q(a, a), true, r(b, a), true), q(a, a))
% 0.11/0.23  = { by axiom 4 (lx1_3) }
% 0.11/0.23    tuple(true, q(a, a))
% 0.11/0.23  = { by axiom 2 (ifeq_axiom) R->L }
% 0.11/0.23    tuple(true, ifeq(true, true, q(a, a), true))
% 0.11/0.23  = { by axiom 1 (lx1) R->L }
% 0.11/0.23    tuple(true, ifeq(r(a, b), true, q(a, a), true))
% 0.11/0.23  = { by axiom 3 (lx1_1) }
% 0.11/0.23    tuple(true, true)
% 0.11/0.23  % SZS output end Proof
% 0.11/0.23  
% 0.11/0.23  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------