↑ Up

CSI_E---1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : LCL249-3 : TPTP v9.3.1. Released v2.3.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:38 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL249-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit   : 300
% 0.09/0.36  % WCLimit    : 300
% 0.09/0.36  % DateTime   : Fri Sep  4 16:28:34 UTC 2026
% 0.09/0.36  % CPUTime    : 
% 0.25/0.48  start to proof:theBenchmark.p
% 0.37/0.60  % Version  : CSI_E---1.1
% 0.37/0.60  % Problem  : theBenchmark.p
% 0.37/0.60  % Proof found!
% 0.37/0.60  # SZS status Unsatisfiable
% 0.37/0.60  % SZS output start Proof
% 0.37/0.60  cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 0.37/0.60  cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 0.37/0.60  cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 0.37/0.60  cnf(axiom_1_6, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_6)).
% 0.37/0.60  cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_4)).
% 0.37/0.60  cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 0.37/0.60  cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 0.37/0.60  cnf(axiom_1_5, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_5)).
% 0.37/0.60  cnf(prove_this, negated_conjecture, (~theorem(implies(implies(p,r),implies(and(p,q),r)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.37/0.60  cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax', and_defn)).
% 0.37/0.60  cnf(c_0_10, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 0.37/0.60  cnf(c_0_11, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_10).
% 0.37/0.60  cnf(c_0_12, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 0.37/0.60  cnf(c_0_13, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.37/0.60  cnf(c_0_14, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_11, c_0_12])).
% 0.37/0.60  cnf(c_0_15, plain, (theorem(X1)|~axiom(X1)), c_0_13).
% 0.37/0.60  cnf(c_0_16, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 0.37/0.60  cnf(c_0_17, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 0.37/0.60  cnf(c_0_18, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 0.37/0.60  cnf(c_0_19, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.37/0.60  cnf(c_0_20, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_12]), c_0_12]), c_0_12])).
% 0.37/0.60  cnf(c_0_21, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))), inference(rw,[status(thm)],[c_0_17, c_0_12])).
% 0.37/0.60  cnf(c_0_22, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_18, c_0_12])).
% 0.37/0.60  cnf(c_0_23, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.37/0.60  cnf(c_0_24, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_19, c_0_21])).
% 0.37/0.60  cnf(c_0_25, plain, (theorem(or(X1,X2))|~theorem(X2)), inference(spm,[status(thm)],[c_0_19, c_0_22])).
% 0.37/0.60  cnf(c_0_26, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_14, c_0_23])).
% 0.37/0.60  cnf(c_0_27, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 0.37/0.60  cnf(c_0_28, plain, (theorem(or(X1,X2))|~theorem(X1)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
% 0.37/0.60  cnf(c_0_29, plain, (theorem(or(X1,X2))|~theorem(or(X1,X3))|~axiom(or(not(X3),X2))), inference(spm,[status(thm)],[c_0_26, c_0_15])).
% 0.37/0.60  cnf(c_0_30, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_27, c_0_12])).
% 0.37/0.60  cnf(c_0_31, plain, (theorem(or(X1,X2))|~theorem(or(X1,X3))|~theorem(not(X3))), inference(spm,[status(thm)],[c_0_26, c_0_28])).
% 0.37/0.60  cnf(c_0_32, plain, (theorem(or(X1,X2))|~axiom(or(X2,X1))), inference(spm,[status(thm)],[c_0_24, c_0_15])).
% 0.37/0.60  cnf(c_0_33, plain, (theorem(or(X1,X2))|~theorem(or(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.37/0.60  cnf(c_0_34, plain, (theorem(or(X1,X2))|~theorem(not(X3))|~axiom(or(X1,X3))), inference(spm,[status(thm)],[c_0_31, c_0_15])).
% 0.37/0.60  cnf(c_0_35, plain, (theorem(X1)|~theorem(X2)|~axiom(or(X1,not(X2)))), inference(spm,[status(thm)],[c_0_14, c_0_32])).
% 0.37/0.60  cnf(c_0_36, plain, (theorem(or(X1,X2))|~axiom(or(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_33, c_0_15])).
% 0.37/0.60  cnf(c_0_37, plain, (theorem(or(not(X1),X2))|~theorem(not(or(X3,X1)))), inference(spm,[status(thm)],[c_0_34, c_0_22])).
% 0.37/0.60  cnf(c_0_38, plain, (theorem(not(or(not(X1),not(X1))))|~theorem(X1)), inference(spm,[status(thm)],[c_0_35, c_0_30])).
% 0.37/0.60  cnf(c_0_39, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), axiom_1_5).
% 0.37/0.60  cnf(c_0_40, plain, (theorem(or(not(X1),X1))), inference(spm,[status(thm)],[c_0_36, c_0_22])).
% 0.37/0.60  cnf(c_0_41, plain, (theorem(or(X1,X2))|~theorem(not(X3))|~axiom(or(X3,X1))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 0.37/0.60  cnf(c_0_42, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_19, c_0_30])).
% 0.37/0.60  cnf(c_0_43, plain, (theorem(or(not(not(X1)),X2))|~theorem(X1)), inference(spm,[status(thm)],[c_0_37, c_0_38])).
% 0.37/0.60  cnf(c_0_44, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), inference(rw,[status(thm)],[c_0_39, c_0_12])).
% 0.37/0.60  cnf(c_0_45, plain, (theorem(or(X1,not(X1)))), inference(spm,[status(thm)],[c_0_24, c_0_40])).
% 0.37/0.60  cnf(c_0_46, plain, (theorem(or(X1,X2))|~theorem(not(not(or(X1,X1))))), inference(spm,[status(thm)],[c_0_41, c_0_30])).
% 0.37/0.60  cnf(c_0_47, plain, (theorem(not(not(X1)))|~theorem(X1)), inference(spm,[status(thm)],[c_0_42, c_0_43])).
% 0.37/0.60  cnf(c_0_48, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_19, c_0_44])).
% 0.37/0.60  cnf(c_0_49, plain, (theorem(or(X1,not(not(X2))))|~theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_26, c_0_45])).
% 0.37/0.60  cnf(c_0_50, plain, (theorem(or(X1,X2))|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_46, c_0_47])).
% 0.37/0.60  cnf(c_0_51, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_48, c_0_15])).
% 0.37/0.60  cnf(c_0_52, plain, (theorem(not(not(X1)))|~theorem(or(not(X2),X1))|~theorem(X2)), inference(spm,[status(thm)],[c_0_14, c_0_49])).
% 0.37/0.60  cnf(c_0_53, plain, (theorem(or(not(or(X1,X1)),X1))), inference(spm,[status(thm)],[c_0_36, c_0_21])).
% 0.37/0.60  cnf(c_0_54, plain, (theorem(or(or(X1,X2),X3))|~axiom(or(X1,or(or(X1,X2),X2)))), inference(spm,[status(thm)],[c_0_50, c_0_51])).
% 0.37/0.60  cnf(c_0_55, plain, (theorem(not(not(X1)))|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_52, c_0_53])).
% 0.37/0.60  cnf(c_0_56, plain, (theorem(or(or(not(X1),X1),X2))), inference(spm,[status(thm)],[c_0_54, c_0_22])).
% 0.37/0.60  cnf(c_0_57, plain, (theorem(or(or(X1,X2),X3))|~theorem(not(not(or(X2,X1))))), inference(spm,[status(thm)],[c_0_41, c_0_21])).
% 0.37/0.60  cnf(c_0_58, plain, (theorem(not(not(or(not(X1),X1))))), inference(spm,[status(thm)],[c_0_55, c_0_56])).
% 0.37/0.60  cnf(c_0_59, negated_conjecture, (~theorem(implies(implies(p,r),implies(and(p,q),r)))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.37/0.60  cnf(c_0_60, plain, (theorem(or(or(X1,not(X1)),X2))), inference(spm,[status(thm)],[c_0_57, c_0_58])).
% 0.37/0.60  cnf(c_0_61, negated_conjecture, (~theorem(implies(implies(p,r),implies(and(p,q),r)))), c_0_59).
% 0.37/0.60  cnf(c_0_62, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 0.37/0.60  cnf(c_0_63, plain, (theorem(or(X1,X2))|~theorem(X3)|~axiom(or(X1,or(not(X3),X2)))), inference(spm,[status(thm)],[c_0_14, c_0_51])).
% 0.37/0.60  cnf(c_0_64, plain, (theorem(or(X1,or(X2,not(X2))))), inference(spm,[status(thm)],[c_0_24, c_0_60])).
% 0.37/0.60  cnf(c_0_65, negated_conjecture, (~theorem(or(not(or(not(p),r)),or(not(not(or(not(p),not(q)))),r)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61, c_0_12]), c_0_12]), c_0_12]), c_0_62])).
% 0.37/0.60  cnf(c_0_66, plain, (theorem(or(not(or(not(X1),X2)),or(X3,X2)))|~theorem(or(X3,X1))), inference(spm,[status(thm)],[c_0_63, c_0_20])).
% 0.37/0.60  cnf(c_0_67, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,or(X3,X2)))), inference(spm,[status(thm)],[c_0_29, c_0_21])).
% 0.37/0.60  cnf(c_0_68, plain, (theorem(or(X1,or(X2,not(X1))))), inference(spm,[status(thm)],[c_0_48, c_0_64])).
% 0.37/0.60  cnf(c_0_69, negated_conjecture, (~theorem(or(not(not(or(not(p),not(q)))),p))), inference(spm,[status(thm)],[c_0_65, c_0_66])).
% 0.37/0.60  cnf(c_0_70, plain, (theorem(or(not(not(X1)),X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_24, c_0_49])).
% 0.37/0.60  cnf(c_0_71, plain, (theorem(or(X1,or(not(X1),X2)))), inference(spm,[status(thm)],[c_0_67, c_0_68])).
% 0.37/0.60  cnf(c_0_72, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69, c_0_70]), c_0_71])]), ['proof']).
% 0.37/0.60  % SZS output end Proof
% 0.37/0.60  % User time                : 0.082 s
% 0.37/0.60  % System time              : 0.007 s
% 0.37/0.60  % Total time               : 0.088 s
% 0.37/0.60  % User time                : 0.357 s
% 0.37/0.60  % System time              : 0.027 s
% 0.37/0.60  % Total time               : 0.384 s
% 0.37/0.60  
%------------------------------------------------------------------------------