↑ Up

Twee---2.7.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : LCL169-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/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 11:49:11 AM UTC 2026

% Result   : Unsatisfiable 0.22s 0.54s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL169-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.43  % Computer : n015.cluster.edu
% 0.16/0.43  % Model    : x86_64 x86_64
% 0.16/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43  % Memory   : 8046.5625MB
% 0.16/0.43  % OS       : Linux 6.8.0-71-generic
% 0.16/0.43  % CPULimit : 300
% 0.16/0.43  % WCLimit  : 300
% 0.16/0.43  % DateTime : Sun Sep 27 15:27:30 UTC 2026
% 0.16/0.43  % CPUTime  : 
% 0.16/0.43  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.54  Command-line arguments: --flatten --complete-subsets
% 0.22/0.54  
% 0.22/0.54  % SZS status Unsatisfiable
% 0.22/0.54  
% 0.22/0.54  % SZS output start Proof
% 0.22/0.54  Axiom 1 (implies_definition): implies(X, Y) = or(not(X), Y).
% 0.22/0.54  Axiom 2 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.22/0.54  Axiom 3 (axiom_1_2): axiom(implies(or(X, X), X)) = true.
% 0.22/0.54  Axiom 4 (rule_1): ifeq(axiom(X), true, theorem(X), true) = true.
% 0.22/0.54  
% 0.22/0.54  Goal 1 (prove_this): theorem(implies(implies(p, not(p)), not(p))) = true.
% 0.22/0.54  Proof:
% 0.22/0.54    theorem(implies(implies(p, not(p)), not(p)))
% 0.22/0.54  = { by axiom 2 (ifeq_axiom) R->L }
% 0.22/0.54    ifeq(true, true, theorem(implies(implies(p, not(p)), not(p))), true)
% 0.22/0.54  = { by axiom 3 (axiom_1_2) R->L }
% 0.22/0.54    ifeq(axiom(implies(or(not(p), not(p)), not(p))), true, theorem(implies(implies(p, not(p)), not(p))), true)
% 0.22/0.54  = { by axiom 1 (implies_definition) }
% 0.22/0.54    ifeq(axiom(or(not(or(not(p), not(p))), not(p))), true, theorem(implies(implies(p, not(p)), not(p))), true)
% 0.22/0.54  = { by axiom 1 (implies_definition) R->L }
% 0.22/0.54    ifeq(axiom(or(not(implies(p, not(p))), not(p))), true, theorem(implies(implies(p, not(p)), not(p))), true)
% 0.22/0.54  = { by axiom 1 (implies_definition) R->L }
% 0.22/0.54    ifeq(axiom(implies(implies(p, not(p)), not(p))), true, theorem(implies(implies(p, not(p)), not(p))), true)
% 0.22/0.54  = { by axiom 4 (rule_1) }
% 0.22/0.54    true
% 0.22/0.54  % SZS output end Proof
% 0.22/0.54  
% 0.22/0.54  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------