↑ Up

CSI_E---1.1.UNS-Ass.s

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

% Computer : n001.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:23 AM UTC 2026

% Result   : Unsatisfiable 0.89s 0.60s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL131-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.10/0.35  % Computer : n001.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit   : 300
% 0.10/0.35  % WCLimit    : 300
% 0.10/0.35  % DateTime   : Sat Sep  5 05:46:46 UTC 2026
% 0.10/0.36  % CPUTime    : 
% 0.25/0.48  start to proof:theBenchmark.p
% 0.89/0.60  % Version  : CSI_E---1.1
% 0.89/0.60  % Problem  : theBenchmark.p
% 0.89/0.60  % Proof found!
% 0.89/0.60  # SZS status Unsatisfiable
% 0.89/0.60  % SZS output start Proof
% 0.89/0.60  cnf(condensed_detachment, axiom, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', condensed_detachment)).
% 0.89/0.60  cnf(s_6, axiom, (is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', s_6)).
% 0.89/0.60  cnf(prove_lg_2, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_lg_2)).
% 0.89/0.60  cnf(c_0_3, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), inference(fof_simplification,[status(thm)],[condensed_detachment])).
% 0.89/0.60  cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 0.89/0.60  cnf(c_0_5, axiom, (is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1))), s_6).
% 0.89/0.60  cnf(c_0_6, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.89/0.60  cnf(c_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(X6,X5)),equivalent(X4,X6))))), inference(spm,[status(thm)],[c_0_6, c_0_5])).
% 0.89/0.60  cnf(c_0_8, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.89/0.60  cnf(c_0_9, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4),equivalent(equivalent(X1,X3),X4)))), inference(spm,[status(thm)],[c_0_6, c_0_8])).
% 0.89/0.60  cnf(c_0_10, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(equivalent(equivalent(X1,X4),equivalent(X2,X4)),X3))), inference(spm,[status(thm)],[c_0_4, c_0_9])).
% 0.89/0.60  cnf(c_0_11, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))), inference(spm,[status(thm)],[c_0_4, c_0_8])).
% 0.89/0.60  cnf(c_0_12, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))), inference(spm,[status(thm)],[c_0_10, c_0_8])).
% 0.89/0.60  cnf(c_0_13, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.89/0.60  cnf(c_0_14, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3))))), inference(spm,[status(thm)],[c_0_10, c_0_13])).
% 0.89/0.60  cnf(c_0_15, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), inference(fof_simplification,[status(thm)],[prove_lg_2])).
% 0.89/0.60  cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))|~is_a_theorem(equivalent(X1,X3))), inference(spm,[status(thm)],[c_0_4, c_0_14])).
% 0.89/0.60  cnf(c_0_17, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), c_0_15).
% 0.89/0.60  cnf(c_0_18, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X3,X2))|~is_a_theorem(equivalent(X3,X1))), inference(spm,[status(thm)],[c_0_4, c_0_16])).
% 0.89/0.60  cnf(c_0_19, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.89/0.60  cnf(c_0_20, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_19, c_0_16])).
% 0.89/0.60  cnf(c_0_21, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))|~is_a_theorem(equivalent(X2,a))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_20, c_0_18])).
% 0.89/0.60  cnf(c_0_22, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),a))|~is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a))), inference(spm,[status(thm)],[c_0_21, c_0_14])).
% 0.89/0.60  cnf(c_0_23, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(b,e),equivalent(c,e)))))|~is_a_theorem(equivalent(equivalent(X2,equivalent(b,c)),a))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_22, c_0_18])).
% 0.89/0.60  cnf(c_0_24, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_18, c_0_13])).
% 0.89/0.60  cnf(c_0_25, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),X2))|~is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a))|~is_a_theorem(equivalent(X2,a))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.89/0.60  cnf(c_0_26, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))),equivalent(X1,equivalent(X2,X4))))), inference(spm,[status(thm)],[c_0_10, c_0_5])).
% 0.89/0.60  cnf(c_0_27, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 0.89/0.60  cnf(c_0_28, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(X2,equivalent(b,c))))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_27, c_0_18])).
% 0.89/0.60  cnf(c_0_29, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_24])).
% 0.89/0.60  cnf(c_0_30, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X1,X4),equivalent(X3,equivalent(X4,X2)))))), inference(spm,[status(thm)],[c_0_10, c_0_9])).
% 0.89/0.60  cnf(c_0_31, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,X2),equivalent(c,X2))),a))), inference(spm,[status(thm)],[c_0_28, c_0_26])).
% 0.89/0.60  cnf(c_0_32, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4))|~is_a_theorem(equivalent(equivalent(X1,X3),X4))), inference(spm,[status(thm)],[c_0_18, c_0_14])).
% 0.89/0.60  cnf(c_0_33, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(equivalent(X1,X4),equivalent(X3,equivalent(X4,X2))))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.89/0.60  cnf(c_0_34, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X2,X4),equivalent(X3,X4)))))), inference(spm,[status(thm)],[c_0_24, c_0_26])).
% 0.89/0.60  cnf(c_0_35, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(b,X2)),a))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 0.89/0.60  cnf(c_0_36, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
% 0.89/0.60  cnf(c_0_37, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_35, c_0_36]), ['proof']).
% 0.89/0.60  % SZS output end Proof
% 0.89/0.60  % User time                : 0.087 s
% 0.89/0.60  % System time              : 0.008 s
% 0.89/0.60  % Total time               : 0.095 s
% 0.89/0.60  % User time                : 0.402 s
% 0.89/0.60  % System time              : 0.035 s
% 0.89/0.60  % Total time               : 0.437 s
% 0.89/0.60  
%------------------------------------------------------------------------------