TSTP Solution File: LCL446-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : LCL446-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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 : Mon May 20 23:46:28 EDT 2024

% Result   : Unsatisfiable 0.13s 0.41s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (   9 unt;   0 nHn;  10 RR)
%            Number of literals    :   25 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   47 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_PropLog_Othms_OMP_0,axiom,
    ( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

cnf(cls_PropLog_Othms_OS_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OS_0) ).

cnf(cls_PropLog_Othms_OK_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OK_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_4,plain,
    ( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).

cnf(c_0_5,plain,
    ( c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    c_0_4 ).

cnf(c_0_6,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
    cls_PropLog_Othms_OS_0 ).

cnf(c_0_7,plain,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,plain,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X5,X2,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X5,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_9,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)),
    cls_PropLog_Othms_OK_0 ).

cnf(c_0_10,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).

cnf(c_0_11,plain,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_p,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    c_0_10 ).

cnf(c_0_13,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
    inference(spm,[status(thm)],[c_0_11,c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem    : LCL446-1 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.09  % Command    : run_E %s %d THM
% 0.08/0.28  % Computer : n014.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit   : 300
% 0.08/0.28  % WCLimit    : 300
% 0.08/0.28  % DateTime   : Mon May 20 00:36:37 EDT 2024
% 0.08/0.28  % CPUTime    : 
% 0.13/0.38  Running first-order theorem proving
% 0.13/0.38  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.41  # Version: 3.1.0
% 0.13/0.41  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41  # Starting sh5l with 300s (1) cores
% 0.13/0.41  # new_bool_1 with pid 18102 completed with status 0
% 0.13/0.41  # Result found by new_bool_1
% 0.13/0.41  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.41  # Search class: FHUSS-FFSF32-MFFFFFNN
% 0.13/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.41  # SAT001_MinMin_p005000_rr_RG with pid 18105 completed with status 0
% 0.13/0.41  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.41  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.41  # Search class: FHUSS-FFSF32-MFFFFFNN
% 0.13/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.41  # Preprocessing time       : 0.002 s
% 0.13/0.41  # Presaturation interreduction done
% 0.13/0.41  
% 0.13/0.41  # Proof found!
% 0.13/0.41  # SZS status Unsatisfiable
% 0.13/0.41  # SZS output start CNFRefutation
% See solution above
% 0.13/0.41  # Parsed axioms                        : 1371
% 0.13/0.41  # Removed by relevancy pruning/SinE    : 1364
% 0.13/0.41  # Initial clauses                      : 7
% 0.13/0.41  # Removed in clause preprocessing      : 0
% 0.13/0.41  # Initial clauses in saturation        : 7
% 0.13/0.41  # Processed clauses                    : 109
% 0.13/0.41  # ...of these trivial                  : 2
% 0.13/0.41  # ...subsumed                          : 41
% 0.13/0.41  # ...remaining for further processing  : 66
% 0.13/0.41  # Other redundant clauses eliminated   : 0
% 0.13/0.41  # Clauses deleted for lack of memory   : 0
% 0.13/0.41  # Backward-subsumed                    : 1
% 0.13/0.41  # Backward-rewritten                   : 6
% 0.13/0.41  # Generated clauses                    : 591
% 0.13/0.41  # ...of the previous two non-redundant : 440
% 0.13/0.41  # ...aggressively subsumed             : 0
% 0.13/0.41  # Contextual simplify-reflections      : 0
% 0.13/0.41  # Paramodulations                      : 589
% 0.13/0.41  # Factorizations                       : 0
% 0.13/0.41  # NegExts                              : 0
% 0.13/0.41  # Equation resolutions                 : 2
% 0.13/0.41  # Disequality decompositions           : 0
% 0.13/0.41  # Total rewrite steps                  : 123
% 0.13/0.41  # ...of those cached                   : 93
% 0.13/0.41  # Propositional unsat checks           : 0
% 0.13/0.41  #    Propositional check models        : 0
% 0.13/0.41  #    Propositional check unsatisfiable : 0
% 0.13/0.41  #    Propositional clauses             : 0
% 0.13/0.41  #    Propositional clauses after purity: 0
% 0.13/0.41  #    Propositional unsat core size     : 0
% 0.13/0.41  #    Propositional preprocessing time  : 0.000
% 0.13/0.41  #    Propositional encoding time       : 0.000
% 0.13/0.41  #    Propositional solver time         : 0.000
% 0.13/0.41  #    Success case prop preproc time    : 0.000
% 0.13/0.41  #    Success case prop encoding time   : 0.000
% 0.13/0.41  #    Success case prop solver time     : 0.000
% 0.13/0.41  # Current number of processed clauses  : 52
% 0.13/0.41  #    Positive orientable unit clauses  : 6
% 0.13/0.41  #    Positive unorientable unit clauses: 0
% 0.13/0.41  #    Negative unit clauses             : 3
% 0.13/0.41  #    Non-unit-clauses                  : 43
% 0.13/0.41  # Current number of unprocessed clauses: 334
% 0.13/0.41  # ...number of literals in the above   : 789
% 0.13/0.41  # Current number of archived formulas  : 0
% 0.13/0.41  # Current number of archived clauses   : 14
% 0.13/0.41  # Clause-clause subsumption calls (NU) : 549
% 0.13/0.41  # Rec. Clause-clause subsumption calls : 549
% 0.13/0.41  # Non-unit clause-clause subsumptions  : 42
% 0.13/0.41  # Unit Clause-clause subsumption calls : 24
% 0.13/0.41  # Rewrite failures with RHS unbound    : 0
% 0.13/0.41  # BW rewrite match attempts            : 47
% 0.13/0.41  # BW rewrite match successes           : 6
% 0.13/0.41  # Condensation attempts                : 0
% 0.13/0.41  # Condensation successes               : 0
% 0.13/0.41  # Termbank termtop insertions          : 19036
% 0.13/0.41  # Search garbage collected termcells   : 2716
% 0.13/0.41  
% 0.13/0.41  # -------------------------------------------------
% 0.13/0.41  # User time                : 0.010 s
% 0.13/0.41  # System time              : 0.003 s
% 0.13/0.41  # Total time               : 0.013 s
% 0.13/0.41  # Maximum resident set size: 2816 pages
% 0.13/0.41  
% 0.13/0.41  # -------------------------------------------------
% 0.13/0.41  # User time                : 0.021 s
% 0.13/0.41  # System time              : 0.005 s
% 0.13/0.41  # Total time               : 0.026 s
% 0.13/0.41  # Maximum resident set size: 2412 pages
% 0.13/0.41  % E---3.1 exiting
% 0.13/0.41  % E exiting
%------------------------------------------------------------------------------