↑ Up

CSI_E---1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : LCL143-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar mcs_scs.jar %d %s

% Computer : n003.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 : Mon Sep  7 11:20:24 AM UTC 2026

% Result   : Unsatisfiable 0.23s 0.54s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL143-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.07/0.36  % Computer : n003.cluster.edu
% 0.07/0.36  % Model    : x86_64 x86_64
% 0.07/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36  % Memory   : 8046.5625MB
% 0.07/0.36  % OS       : Linux 6.8.0-71-generic
% 0.07/0.36  % CPULimit   : 300
% 0.07/0.36  % WCLimit    : 300
% 0.07/0.36  % DateTime   : Fri Sep  4 23:46:20 UTC 2026
% 0.11/0.36  % CPUTime    : 
% 0.23/0.47  start to proof:theBenchmark.p
% 0.23/0.54  % Version  : CSI_E---1.1
% 0.23/0.54  % Problem  : theBenchmark.p
% 0.23/0.54  % Proof found!
% 0.23/0.54  # SZS status Unsatisfiable
% 0.23/0.54  % SZS output start Proof
% 0.23/0.54  cnf(partial_order_definition1, axiom, (implies(X1,X2)=truth|~ordered(X1,X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL001-1.ax', partial_order_definition1)).
% 0.23/0.54  cnf(antecedent, negated_conjecture, (ordered(x,y)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', antecedent)).
% 0.23/0.54  cnf(prove_wajsberg_theorem, negated_conjecture, (~ordered(implies(z,x),implies(z,y))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_wajsberg_theorem)).
% 0.23/0.54  cnf(partial_order_definition2, axiom, (ordered(X1,X2)|implies(X1,X2)!=truth), file('/export/starexec/sandbox/benchmark/Axioms/LCL001-1.ax', partial_order_definition2)).
% 0.23/0.54  cnf(wajsberg_2, axiom, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth), file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax', wajsberg_2)).
% 0.23/0.54  cnf(wajsberg_1, axiom, (implies(truth,X1)=X1), file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax', wajsberg_1)).
% 0.23/0.54  cnf(c_0_6, axiom, (implies(X1,X2)=truth|~ordered(X1,X2)), partial_order_definition1).
% 0.23/0.54  cnf(c_0_7, negated_conjecture, (ordered(x,y)), antecedent).
% 0.23/0.54  cnf(c_0_8, negated_conjecture, (~ordered(implies(z,x),implies(z,y))), prove_wajsberg_theorem).
% 0.23/0.54  cnf(c_0_9, axiom, (ordered(X1,X2)|implies(X1,X2)!=truth), partial_order_definition2).
% 0.23/0.54  cnf(c_0_10, axiom, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth), wajsberg_2).
% 0.23/0.54  cnf(c_0_11, negated_conjecture, (implies(x,y)=truth), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.23/0.54  cnf(c_0_12, axiom, (implies(truth,X1)=X1), wajsberg_1).
% 0.23/0.54  cnf(c_0_13, negated_conjecture, (implies(implies(z,x),implies(z,y))!=truth), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.23/0.54  cnf(c_0_14, negated_conjecture, (implies(implies(X1,x),implies(X1,y))=truth), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
% 0.23/0.54  cnf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']).
% 0.23/0.54  % SZS output end Proof
% 0.23/0.54  % User time                : 0.027 s
% 0.23/0.54  % System time              : 0.005 s
% 0.23/0.54  % Total time               : 0.032 s
% 0.23/0.54  
%------------------------------------------------------------------------------