TSTP Solution File: LCL086-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 06:47:55 EDT 2023

% Result   : Unsatisfiable 0.20s 0.67s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Thu Aug 24 18:25:32 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  % File        :CSE---1.6
% 0.20/0.67  % Problem     :theBenchmark
% 0.20/0.67  % Transform   :cnf
% 0.20/0.67  % Format      :tptp:raw
% 0.20/0.67  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.67  
% 0.20/0.67  % Result      :Theorem 0.050000s
% 0.20/0.67  % Output      :CNFRefutation 0.050000s
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  % File     : LCL086-1 : TPTP v8.1.2. Released v1.0.0.
% 0.20/0.67  % Domain   : Logic Calculi (Implicational propositional)
% 0.20/0.67  % Problem  : IC-1 depends on the 4th Lukasiewicz axiom
% 0.20/0.67  % Version  : [TPTP] axioms.
% 0.20/0.67  % English  : Axiomatisations of the Implicational propositional calculus
% 0.20/0.67  %            are {IC-2,IC-3,IC-4} by Tarski-Bernays and single Lukasiewicz
% 0.20/0.67  %            axioms. Show that IC-1 depends on the fourth Lukasiewicz
% 0.20/0.67  %            axiom.
% 0.20/0.67  
% 0.20/0.67  % Refs     : [Luk48] Lukasiewicz (1948), The Shortest Axiom of the Implicat
% 0.20/0.67  %          : [Pfe88] Pfenning (1988), Single Axioms in the Implicational Pr
% 0.20/0.67  % Source   : [TPTP]
% 0.20/0.67  % Names    :
% 0.20/0.67  
% 0.20/0.67  % Status   : Unsatisfiable
% 0.20/0.67  % Rating   : 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.12 v5.4.0, 0.17 v5.3.0, 0.20 v5.2.0, 0.08 v5.1.0, 0.19 v5.0.0, 0.20 v4.0.1, 0.00 v2.6.0, 0.29 v2.5.0, 0.00 v2.4.0, 0.00 v2.3.0, 0.14 v2.2.1, 0.22 v2.1.0, 0.25 v2.0.0
% 0.20/0.67  % Syntax   : Number of clauses     :    3 (   2 unt;   0 nHn;   2 RR)
% 0.20/0.67  %            Number of literals    :    5 (   0 equ;   3 neg)
% 0.20/0.67  %            Maximal clause size   :    3 (   1 avg)
% 0.20/0.67  %            Maximal term depth    :    5 (   2 avg)
% 0.20/0.67  %            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
% 0.20/0.67  %            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
% 0.20/0.67  %            Number of variables   :    7 (   2 sgn)
% 0.20/0.67  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.67  
% 0.20/0.67  % Comments :
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  cnf(condensed_detachment,axiom,
% 0.20/0.67      ( ~ is_a_theorem(implies(X,Y))
% 0.20/0.67      | ~ is_a_theorem(X)
% 0.20/0.67      | is_a_theorem(Y) ) ).
% 0.20/0.67  
% 0.20/0.67  cnf(ic_JLukasiewicz_4,axiom,
% 0.20/0.67      is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(T,implies(implies(S,P),implies(R,P))))) ).
% 0.20/0.67  
% 0.20/0.67  cnf(prove_ic_1,negated_conjecture,
% 0.20/0.67      ~ is_a_theorem(implies(a,a)) ).
% 0.20/0.67  
% 0.20/0.67  %--------------------------------------------------------------------------
% 0.20/0.67  %-------------------------------------------
% 0.20/0.67  % Proof found
% 0.20/0.67  % SZS status Theorem for theBenchmark
% 0.20/0.67  % SZS output start Proof
% 0.20/0.67  %ClaNum:3(EqnAxiom:0)
% 0.20/0.67  %VarNum:13(SingletonVarNum:7)
% 0.20/0.67  %MaxLitNum:3
% 0.20/0.67  %MaxfuncDepth:4
% 0.20/0.67  %SharedTerms:3
% 0.20/0.67  %goalClause: 2
% 0.20/0.67  %singleGoalClaCount:1
% 0.20/0.67  [2]~P1(f1(a2,a2))
% 0.20/0.67  [1]P1(f1(f1(f1(x11,x12),f1(x13,x14)),f1(x15,f1(f1(x14,x11),f1(x13,x11)))))
% 0.20/0.67  [3]P1(x31)+~P1(x32)+~P1(f1(x32,x31))
% 0.20/0.67  %EqnAxiom
% 0.20/0.67  
% 0.20/0.67  %-------------------------------------------
% 0.20/0.68  cnf(5,plain,
% 0.20/0.68     (P1(f1(x51,f1(f1(x52,x53),f1(x54,x53))))+~P1(f1(f1(x53,x55),f1(x54,x52)))),
% 0.20/0.68     inference(scs_inference,[],[1,3])).
% 0.20/0.68  cnf(6,plain,
% 0.20/0.68     (P1(f1(x61,f1(f1(f1(f1(x62,x63),f1(x64,x63)),f1(x63,x65)),f1(x66,f1(x63,x65)))))),
% 0.20/0.68     inference(scs_inference,[],[1,5])).
% 0.20/0.68  cnf(8,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(x81,x82),f1(x83,x82)),f1(x82,x84)),f1(x85,f1(x82,x84))))),
% 0.20/0.68     inference(scs_inference,[],[6,1,3])).
% 0.20/0.68  cnf(16,plain,
% 0.20/0.68     (P1(f1(x161,f1(x162,f1(f1(x162,x163),f1(x164,x163)))))),
% 0.20/0.68     inference(scs_inference,[],[8,1,3])).
% 0.20/0.68  cnf(20,plain,
% 0.20/0.68     (P1(f1(x201,f1(f1(f1(f1(x202,x203),f1(x204,x203)),x205),f1(x202,x205))))),
% 0.20/0.68     inference(scs_inference,[],[16,5])).
% 0.20/0.68  cnf(21,plain,
% 0.20/0.68     (P1(f1(x211,f1(x212,f1(f1(x212,x213),f1(x214,x213)))))),
% 0.20/0.68     inference(rename_variables,[],[16])).
% 0.20/0.68  cnf(23,plain,
% 0.20/0.68     (P1(f1(x231,f1(f1(x231,x232),f1(x233,x232))))),
% 0.20/0.68     inference(scs_inference,[],[16,21,6,5,3])).
% 0.20/0.68  cnf(28,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(x281,x282),f1(x283,x282)),x284),f1(x281,x284)))),
% 0.20/0.68     inference(scs_inference,[],[16,20,3])).
% 0.20/0.68  cnf(34,plain,
% 0.20/0.68     (P1(f1(f1(f1(f1(f1(f1(x341,x342),f1(x343,x342)),x344),f1(x341,x344)),x345),f1(x346,x345)))),
% 0.20/0.68     inference(scs_inference,[],[23,28,3])).
% 0.20/0.68  cnf(37,plain,
% 0.20/0.68     (~P1(f1(f1(x371,f1(f1(x371,x372),f1(x373,x372))),f1(a2,a2)))),
% 0.20/0.68     inference(scs_inference,[],[23,2,3])).
% 0.20/0.68  cnf(39,plain,
% 0.20/0.68     (P1(f1(f1(x391,x392),f1(x393,f1(x392,f1(x394,x392)))))),
% 0.20/0.68     inference(scs_inference,[],[28,8,3])).
% 0.20/0.68  cnf(50,plain,
% 0.20/0.68     (P1(f1(x501,f1(f1(x502,x503),f1(x504,f1(x502,x503)))))),
% 0.20/0.68     inference(scs_inference,[],[28,39,3])).
% 0.20/0.68  cnf(53,plain,
% 0.20/0.68     (P1(f1(f1(x531,x532),f1(x533,f1(x531,x532))))),
% 0.20/0.68     inference(scs_inference,[],[34,50,3])).
% 0.20/0.68  cnf(56,plain,
% 0.20/0.68     (P1(f1(x561,f1(f1(f1(x562,x563),x562),f1(x564,x562))))),
% 0.20/0.68     inference(scs_inference,[],[53,5])).
% 0.20/0.68  cnf(60,plain,
% 0.20/0.68     (P1(f1(f1(f1(x601,x602),x601),f1(x603,x601)))),
% 0.20/0.68     inference(scs_inference,[],[34,56,3])).
% 0.20/0.68  cnf(63,plain,
% 0.20/0.68     (~P1(f1(f1(f1(a2,a2),x631),f1(a2,a2)))),
% 0.20/0.68     inference(scs_inference,[],[37,60,3])).
% 0.20/0.68  cnf(66,plain,
% 0.20/0.68     ($false),
% 0.20/0.68     inference(scs_inference,[],[63,60]),
% 0.20/0.68     ['proof']).
% 0.20/0.68  % SZS output end Proof
% 0.20/0.68  % Total time :0.050000s
%------------------------------------------------------------------------------