↑ Up

CSI_E---1.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSI_E---1.1
% Problem  : LCL239-10 : TPTP v9.3.1. Released v7.5.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:37 AM UTC 2026

% Result   : Unsatisfiable 0.25s 0.53s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.03  % Command    : java -jar mcs_scs.jar %d %s
% 0.08/0.33  % Computer : n001.cluster.edu
% 0.08/0.33  % Model    : x86_64 x86_64
% 0.08/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33  % Memory   : 8046.5625MB
% 0.08/0.33  % OS       : Linux 6.8.0-71-generic
% 0.08/0.33  % CPULimit   : 300
% 0.08/0.33  % WCLimit    : 300
% 0.08/0.33  % DateTime   : Sat Sep  5 10:50:31 UTC 2026
% 0.08/0.34  % CPUTime    : 
% 0.13/0.46  start to proof:theBenchmark.p
% 0.25/0.53  % Version  : CSI_E---1.1
% 0.25/0.53  % Problem  : theBenchmark.p
% 0.25/0.53  % Proof found!
% 0.25/0.53  # SZS status Unsatisfiable
% 0.25/0.53  % SZS output start Proof
% 0.25/0.53  cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_3)).
% 0.25/0.53  cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', implies_definition)).
% 0.25/0.53  cnf(rule_2, axiom, (ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rule_2)).
% 0.25/0.53  cnf(rule_1, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rule_1)).
% 0.25/0.53  cnf(ifeq_axiom, axiom, (ifeq(X1,X1,X2,X3)=X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ifeq_axiom)).
% 0.25/0.53  cnf(axiom_1_5, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_5)).
% 0.25/0.53  cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_4)).
% 0.25/0.53  cnf(prove_this, negated_conjecture, (theorem(not(and(p,not(p))))!=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.25/0.53  cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', and_defn)).
% 0.25/0.53  cnf(c_0_9, axiom, (axiom(implies(X1,or(X2,X1)))=true), axiom_1_3).
% 0.25/0.53  cnf(c_0_10, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 0.25/0.53  cnf(c_0_11, axiom, (ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), rule_2).
% 0.25/0.53  cnf(c_0_12, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), rule_1).
% 0.25/0.53  cnf(c_0_13, plain, (axiom(or(not(X1),or(X2,X1)))=true), inference(rw,[status(thm)],[c_0_9, c_0_10])).
% 0.25/0.53  cnf(c_0_14, axiom, (ifeq(X1,X1,X2,X3)=X2), ifeq_axiom).
% 0.25/0.53  cnf(c_0_15, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))=true), axiom_1_5).
% 0.25/0.53  cnf(c_0_16, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))=true), axiom_1_4).
% 0.25/0.53  cnf(c_0_17, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), inference(rw,[status(thm)],[c_0_11, c_0_10])).
% 0.25/0.53  cnf(c_0_18, plain, (theorem(or(not(X1),or(X2,X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
% 0.25/0.53  cnf(c_0_19, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), inference(rw,[status(thm)],[c_0_15, c_0_10])).
% 0.25/0.53  cnf(c_0_20, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true), inference(rw,[status(thm)],[c_0_16, c_0_10])).
% 0.25/0.53  cnf(c_0_21, plain, (ifeq(theorem(or(not(or(not(X1),or(X2,X1))),X3)),true,theorem(X3),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_14])).
% 0.25/0.53  cnf(c_0_22, plain, (theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_19]), c_0_14])).
% 0.25/0.53  cnf(c_0_23, plain, (theorem(or(not(or(X1,X2)),or(X2,X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_20]), c_0_14])).
% 0.25/0.53  cnf(c_0_24, plain, (theorem(or(X1,or(not(X2),X2)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_14])).
% 0.25/0.53  cnf(c_0_25, plain, (ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_23]), c_0_14])).
% 0.25/0.53  cnf(c_0_26, plain, (theorem(or(not(X1),X1))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_24]), c_0_14])).
% 0.25/0.53  cnf(c_0_27, negated_conjecture, (theorem(not(and(p,not(p))))!=true), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.25/0.53  cnf(c_0_28, plain, (theorem(or(X1,not(X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_14])).
% 0.25/0.53  cnf(c_0_29, negated_conjecture, (theorem(not(and(p,not(p))))!=true), c_0_27).
% 0.25/0.53  cnf(c_0_30, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 0.25/0.53  cnf(c_0_31, plain, (ifeq(theorem(X1),true,theorem(not(not(X1))),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_28]), c_0_14])).
% 0.25/0.53  cnf(c_0_32, negated_conjecture, (theorem(not(not(or(not(p),not(not(p))))))!=true), inference(rw,[status(thm)],[c_0_29, c_0_30])).
% 0.25/0.53  cnf(c_0_33, plain, (theorem(not(not(or(X1,not(X1)))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_28]), c_0_14])).
% 0.25/0.53  cnf(c_0_34, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32, c_0_33])]), ['proof']).
% 0.25/0.53  % SZS output end Proof
% 0.25/0.53  % User time                : 0.016 s
% 0.25/0.53  % System time              : 0.003 s
% 0.25/0.53  % Total time               : 0.019 s
% 0.25/0.53  % User time                : 0.062 s
% 0.25/0.53  % System time              : 0.013 s
% 0.25/0.53  % Total time               : 0.075 s
% 0.25/0.53  
%------------------------------------------------------------------------------