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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : LCL101-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:58 EDT 2023

% Result   : Unsatisfiable 0.21s 0.72s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14  % 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:52:02 EDT 2023
% 0.13/0.36  % CPUTime    : 
% 0.21/0.60  start to proof:theBenchmark
% 0.21/0.72  %-------------------------------------------
% 0.21/0.72  % File        :CSE---1.6
% 0.21/0.72  % Problem     :theBenchmark
% 0.21/0.72  % Transform   :cnf
% 0.21/0.72  % Format      :tptp:raw
% 0.21/0.72  % Command     :java -jar mcs_scs.jar %d %s
% 0.21/0.72  
% 0.21/0.72  % Result      :Theorem 0.060000s
% 0.21/0.72  % Output      :CNFRefutation 0.060000s
% 0.21/0.72  %-------------------------------------------
% 0.21/0.72  %--------------------------------------------------------------------------
% 0.21/0.72  % File     : LCL101-1 : TPTP v8.1.2. Released v1.0.0.
% 0.21/0.72  % Domain   : Logic Calculi (Left group)
% 0.21/0.72  % Problem  : P-1 depends on the 3rd McCune system
% 0.21/0.72  % Version  : [McC92b] axioms.
% 0.21/0.72  % English  : Axiomatisations of the left group calculus are {LG-1,
% 0.21/0.72  %            LG-2,LG-3,LG-4,LG-5} by Kalman, {LG-2,LG-3}, {LG-2,P-1},
% 0.21/0.72  %            {LG-2,P-4}, {LG-2,Q-1,Q-2}, {P-1,Q-3}, {P-4,Q-3}, {Q-1,
% 0.21/0.72  %            Q-2,Q-3}, {Q-1,Q-3,Q-4}, {LG-27-1690} all by McCune. Show
% 0.21/0.72  %            that P-1 depends on the 3rd McCune system.
% 0.21/0.72  
% 0.21/0.72  % Refs     : [MW92]  McCune & Wos (1992), Experiments in Automated Deductio
% 0.21/0.72  %          : [McC92a] McCune (1992), Automated Discovery of New Axiomatisat
% 0.21/0.72  %          : [McC92b] McCune (1992), Email to G. Sutcliffe
% 0.21/0.72  % Source   : [McC92b]
% 0.21/0.72  % Names    : LG-94 [MW92]
% 0.21/0.72  
% 0.21/0.72  % Status   : Unsatisfiable
% 0.21/0.72  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.05 v5.2.0, 0.08 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v2.2.1, 0.11 v2.1.0, 0.13 v2.0.0
% 0.21/0.72  % Syntax   : Number of clauses     :    4 (   3 unt;   0 nHn;   2 RR)
% 0.21/0.72  %            Number of literals    :    6 (   0 equ;   3 neg)
% 0.21/0.72  %            Maximal clause size   :    3 (   1 avg)
% 0.21/0.72  %            Maximal term depth    :    6 (   2 avg)
% 0.21/0.72  %            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
% 0.21/0.72  %            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
% 0.21/0.72  %            Number of variables   :   10 (   0 sgn)
% 0.21/0.72  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.21/0.72  
% 0.21/0.72  % Comments :
% 0.21/0.72  %--------------------------------------------------------------------------
% 0.21/0.72  cnf(condensed_detachment,axiom,
% 0.21/0.72      ( ~ is_a_theorem(equivalent(X,Y))
% 0.21/0.72      | ~ is_a_theorem(X)
% 0.21/0.72      | is_a_theorem(Y) ) ).
% 0.21/0.72  
% 0.21/0.72  cnf(lg_2,axiom,
% 0.21/0.72      is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)) ).
% 0.21/0.72  
% 0.21/0.72  cnf(p_4,axiom,
% 0.21/0.72      is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(equivalent(Y,Z),equivalent(Y,U)),equivalent(Z,U)),X))) ).
% 0.21/0.72  
% 0.21/0.72  cnf(prove_p_1,negated_conjecture,
% 0.21/0.72      ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))) ).
% 0.21/0.72  
% 0.21/0.72  %--------------------------------------------------------------------------
% 0.21/0.72  %-------------------------------------------
% 0.21/0.72  % Proof found
% 0.21/0.72  % SZS status Theorem for theBenchmark
% 0.21/0.72  % SZS output start Proof
% 0.21/0.72  %ClaNum:4(EqnAxiom:0)
% 0.21/0.72  %VarNum:20(SingletonVarNum:10)
% 0.21/0.72  %MaxLitNum:3
% 0.21/0.72  %MaxfuncDepth:4
% 0.21/0.72  %SharedTerms:12
% 0.21/0.72  %goalClause: 3
% 0.21/0.72  %singleGoalClaCount:1
% 0.21/0.72  [3]~P1(f1(f1(f1(a2,a3),a4),f1(f1(a5,a3),f1(f1(a2,a5),a4))))
% 0.21/0.72  [1]P1(f1(x11,f1(f1(f1(f1(x12,x13),f1(x12,x14)),f1(x13,x14)),x11)))
% 0.21/0.73  [2]P1(f1(f1(f1(f1(f1(x21,x22),f1(x21,x23)),f1(x22,x23)),x24),x24))
% 0.21/0.73  [4]P1(x41)+~P1(x42)+~P1(f1(x42,x41))
% 0.21/0.73  %EqnAxiom
% 0.21/0.73  
% 0.21/0.73  %-------------------------------------------
% 0.21/0.73  cnf(5,plain,
% 0.21/0.73     (P1(f1(f1(f1(f1(x51,x52),f1(x51,x53)),f1(x52,x53)),f1(f1(f1(x54,x55),f1(x54,x56)),f1(x55,x56))))),
% 0.21/0.73     inference(scs_inference,[],[1,2,4])).
% 0.21/0.73  cnf(10,plain,
% 0.21/0.73     (P1(f1(f1(f1(x101,x102),f1(x101,x103)),f1(x102,x103)))),
% 0.21/0.73     inference(scs_inference,[],[2,5,4])).
% 0.21/0.73  cnf(14,plain,
% 0.21/0.73     (P1(f1(f1(x141,x142),f1(x141,x142)))),
% 0.21/0.73     inference(scs_inference,[],[5,10,4])).
% 0.21/0.73  cnf(21,plain,
% 0.21/0.73     (P1(f1(x211,x211))),
% 0.21/0.73     inference(scs_inference,[],[10,14,4])).
% 0.21/0.73  cnf(25,plain,
% 0.21/0.73     (P1(f1(f1(f1(f1(x251,x252),f1(x251,x253)),f1(x252,x253)),f1(x254,x254)))),
% 0.21/0.73     inference(scs_inference,[],[21,1,4])).
% 0.21/0.73  cnf(28,plain,
% 0.21/0.73     (P1(f1(f1(x281,x282),f1(f1(x283,x281),f1(x283,x282))))),
% 0.21/0.73     inference(scs_inference,[],[10,25,4])).
% 0.21/0.73  cnf(32,plain,
% 0.21/0.73     (P1(f1(f1(x321,f1(f1(x322,x323),f1(x322,x324))),f1(x321,f1(x323,x324))))),
% 0.21/0.73     inference(scs_inference,[],[10,28,4])).
% 0.21/0.73  cnf(35,plain,
% 0.21/0.73     (P1(f1(f1(f1(f1(x351,x352),f1(x351,x353)),x354),f1(f1(x352,x353),x354)))),
% 0.21/0.73     inference(scs_inference,[],[32,1,4])).
% 0.21/0.73  cnf(39,plain,
% 0.21/0.73     (~P1(f1(f1(f1(x391,f1(a2,a3)),f1(x391,a4)),f1(f1(a5,a3),f1(f1(a2,a5),a4))))),
% 0.21/0.73     inference(scs_inference,[],[35,3,4])).
% 0.21/0.73  cnf(42,plain,
% 0.21/0.73     ($false),
% 0.21/0.73     inference(scs_inference,[],[35,39]),
% 0.21/0.73     ['proof']).
% 0.21/0.73  % SZS output end Proof
% 0.21/0.73  % Total time :0.060000s
%------------------------------------------------------------------------------