TSTP Solution File: LCL445-2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : LCL445-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n031.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:49:22 EDT 2023

% Result   : Unsatisfiable 0.19s 0.62s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL445-2 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34  % Computer : n031.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Thu Aug 24 17:44:51 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.57  start to proof:theBenchmark
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  % File        :CSE---1.6
% 0.19/0.61  % Problem     :theBenchmark
% 0.19/0.61  % Transform   :cnf
% 0.19/0.61  % Format      :tptp:raw
% 0.19/0.61  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.61  
% 0.19/0.61  % Result      :Theorem 0.000000s
% 0.19/0.61  % Output      :CNFRefutation 0.000000s
% 0.19/0.61  %-------------------------------------------
% 0.19/0.61  %------------------------------------------------------------------------------
% 0.19/0.61  % File     : LCL445-2 : TPTP v8.1.2. Released v3.2.0.
% 0.19/0.61  % Domain   : Logic Calculi (Propositional)
% 0.19/0.61  % Problem  : Problem about propositional logic
% 0.19/0.61  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.19/0.61  % English  :
% 0.19/0.61  
% 0.19/0.61  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.19/0.61  % Source   : [Pau06]
% 0.19/0.61  % Names    :
% 0.19/0.61  
% 0.19/0.61  % Status   : Unsatisfiable
% 0.19/0.61  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.19/0.61  % Syntax   : Number of clauses     :    6 (   4 unt;   0 nHn;   5 RR)
% 0.19/0.61  %            Number of literals    :    9 (   0 equ;   4 neg)
% 0.19/0.61  %            Maximal clause size   :    3 (   1 avg)
% 0.19/0.61  %            Maximal term depth    :    5 (   2 avg)
% 0.19/0.61  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.19/0.61  %            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
% 0.19/0.61  %            Number of variables   :   12 (   1 sgn)
% 0.19/0.61  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.61  
% 0.19/0.61  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.19/0.61  %            of which only a small selection are required for the refutation.
% 0.19/0.61  %            The mission is to find those few axioms, after which a refutation
% 0.19/0.61  %            can be quite easily found. This version has only the necessary
% 0.19/0.62  %            axioms.
% 0.19/0.62  %------------------------------------------------------------------------------
% 0.19/0.62  cnf(cls_conjecture_0,negated_conjecture,
% 0.19/0.62      c_in(v_q,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ).
% 0.19/0.62  
% 0.19/0.62  cnf(cls_conjecture_1,negated_conjecture,
% 0.19/0.62      c_in(v_q,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ).
% 0.19/0.62  
% 0.19/0.62  cnf(cls_conjecture_2,negated_conjecture,
% 0.19/0.62      ~ c_in(v_q,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ).
% 0.19/0.62  
% 0.19/0.62  cnf(cls_PropLog_Odeduction_0,axiom,
% 0.19/0.62      ( ~ c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a))
% 0.19/0.62      | c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.19/0.62  
% 0.19/0.62  cnf(cls_PropLog_Othms_OMP_0,axiom,
% 0.19/0.62      ( ~ c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.19/0.62      | ~ c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
% 0.19/0.62      | c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ) ).
% 0.19/0.62  
% 0.19/0.62  cnf(cls_PropLog_Othms__excluded__middle_0,axiom,
% 0.19/0.62      c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),V_q,T_a),V_q,T_a),T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ).
% 0.19/0.62  
% 0.19/0.62  %------------------------------------------------------------------------------
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  % Proof found
% 0.19/0.62  % SZS status Theorem for theBenchmark
% 0.19/0.62  % SZS output start Proof
% 0.19/0.62  %ClaNum:6(EqnAxiom:0)
% 0.19/0.62  %VarNum:39(SingletonVarNum:12)
% 0.19/0.62  %MaxLitNum:3
% 0.19/0.62  %MaxfuncDepth:4
% 0.19/0.62  %SharedTerms:15
% 0.19/0.62  %goalClause: 1 2 4
% 0.19/0.62  %singleGoalClaCount:3
% 0.19/0.62  [4]~P1(a1,f6(a3,a4),f9(a4))
% 0.19/0.62  [1]P1(a1,f6(f5(a2,a3,f9(a4)),a4),f9(a4))
% 0.19/0.62  [2]P1(a1,f6(f5(f8(a2,a7,a4),a3,f9(a4)),a4),f9(a4))
% 0.19/0.62  [3]P1(f8(f8(x31,x32,x33),f8(f8(f8(x31,a7,x33),x32,x33),x32,x33),x33),f6(x34,x33),f9(x33))
% 0.19/0.62  [6]P1(f8(x61,x62,x63),f6(x64,x63),f9(x63))+~P1(x62,f6(f5(x61,x64,f9(x63)),x63),f9(x63))
% 0.19/0.62  [5]~P1(f8(x54,x51,x53),f6(x52,x53),f9(x53))+P1(x51,f6(x52,x53),f9(x53))+~P1(x54,f6(x52,x53),f9(x53))
% 0.19/0.62  %EqnAxiom
% 0.19/0.62  
% 0.19/0.62  %-------------------------------------------
% 0.19/0.62  cnf(8,plain,
% 0.19/0.62     (P1(f8(f8(f8(a2,a7,a4),a1,a4),a1,a4),f6(a3,a4),f9(a4))),
% 0.19/0.62     inference(scs_inference,[],[1,3,6,5])).
% 0.19/0.62  cnf(19,plain,
% 0.19/0.62     ($false),
% 0.19/0.62     inference(scs_inference,[],[2,4,8,5,6]),
% 0.19/0.62     ['proof']).
% 0.19/0.62  % SZS output end Proof
% 0.19/0.62  % Total time :0.000000s
%------------------------------------------------------------------------------