↑ Up

Twee---2.7.THM-Prf.s

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

% Computer : n011.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 12:04:44 PM UTC 2026

% Result   : Theorem 9.99s 1.79s
% Output   : Proof 9.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MSC019+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 17:43:30 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.99/1.79  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
% 9.99/1.79  
% 9.99/1.79  % SZS status Theorem
% 9.99/1.79  
% 9.99/1.79  % SZS output start Proof
% 9.99/1.79  Axiom 1 (kb74): s_contains(s_g013, s_MX) = true.
% 9.99/1.79  Axiom 2 (kb18): s_contains(s_g019, s_g013) = true.
% 9.99/1.79  Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 9.99/1.79  Axiom 4 (axiom1): ifeq(s_contains(X, Y), true, ifeq(s_contains(Z, X), true, s_contains(Z, Y), true), true) = true.
% 9.99/1.79  
% 9.99/1.79  Goal 1 (mexico_in_america_1): s_contains(s_g019, s_MX) = true.
% 9.99/1.79  Proof:
% 9.99/1.79    s_contains(s_g019, s_MX)
% 9.99/1.79  = { by axiom 3 (ifeq_axiom) R->L }
% 9.99/1.79    ifeq(true, true, s_contains(s_g019, s_MX), true)
% 9.99/1.79  = { by axiom 2 (kb18) R->L }
% 9.99/1.79    ifeq(s_contains(s_g019, s_g013), true, s_contains(s_g019, s_MX), true)
% 9.99/1.79  = { by axiom 3 (ifeq_axiom) R->L }
% 9.99/1.79    ifeq(true, true, ifeq(s_contains(s_g019, s_g013), true, s_contains(s_g019, s_MX), true), true)
% 9.99/1.79  = { by axiom 1 (kb74) R->L }
% 9.99/1.79    ifeq(s_contains(s_g013, s_MX), true, ifeq(s_contains(s_g019, s_g013), true, s_contains(s_g019, s_MX), true), true)
% 9.99/1.79  = { by axiom 4 (axiom1) }
% 9.99/1.79    true
% 9.99/1.79  % SZS output end Proof
% 9.99/1.79  
% 9.99/1.79  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------