TSTP Solution File: LCL433-2 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n009.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:56:51 EDT 2024

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   28 (   9 unt;   0 nHn;  23 RR)
%            Number of literals    :   53 (   0 equ;  29 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   69 (   5 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/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).

cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
    ( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).

cnf(cls_PropLog_Othms_OH_0,axiom,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
    | ~ c_PropLog_Osat(v_F,X1,t_a) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).

cnf(cls_PropLog_Osat__imp_0,axiom,
    ( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
    | ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Osat__imp_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_0_8,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_9,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__insert_0]) ).

cnf(c_0_10,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_8 ).

cnf(c_0_11,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    c_0_9 ).

cnf(c_0_12,plain,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).

cnf(c_0_13,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(X5,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    ( c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
    | ~ c_in(X1,X2,tc_PropLog_Opl(X3)) ),
    c_0_12 ).

cnf(c_0_15,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
    | ~ c_PropLog_Osat(v_F,X1,t_a) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_16,plain,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
    | ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
    | ~ c_PropLog_Osat(v_F,X1,t_a) ),
    c_0_15 ).

cnf(c_0_18,negated_conjecture,
    ~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_19,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | ~ c_in(X3,c_insert(X2,v_F,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
    | ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(X3,X1,t_a),t_a) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_21,negated_conjecture,
    ~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    c_0_18 ).

cnf(c_0_22,negated_conjecture,
    ( c_in(X1,c_PropLog_Othms(c_insert(X2,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
    | ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(X2,X1,t_a),t_a) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
    | ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
    inference(fof_simplification,[status(thm)],[cls_PropLog_Osat__imp_0]) ).

cnf(c_0_24,negated_conjecture,
    ~ c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,plain,
    ( c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3)
    | ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3) ),
    c_0_23 ).

cnf(c_0_26,negated_conjecture,
    c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
    cls_conjecture_2 ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : LCL433-2 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 01:36:23 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order model finding
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # sh5l with pid 6962 completed with status 0
% 0.19/0.48  # Result found by sh5l
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48  # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48  # SAT001_MinMin_p005000_rr_RG with pid 6966 completed with status 0
% 0.19/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.48  # Search class: FHUNF-FFSF32-MFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Unsatisfiable
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 8
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.48  # Initial clauses                      : 8
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 8
% 0.19/0.48  # Processed clauses                    : 67
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 3
% 0.19/0.48  # ...remaining for further processing  : 64
% 0.19/0.48  # Other redundant clauses eliminated   : 0
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 139
% 0.19/0.48  # ...of the previous two non-redundant : 138
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 139
% 0.19/0.48  # Factorizations                       : 0
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 0
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 1
% 0.19/0.48  # ...of those cached                   : 0
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 56
% 0.19/0.48  #    Positive orientable unit clauses  : 2
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 10
% 0.19/0.48  #    Non-unit-clauses                  : 44
% 0.19/0.48  # Current number of unprocessed clauses: 87
% 0.19/0.48  # ...number of literals in the above   : 281
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 8
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 464
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 456
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 2
% 0.19/0.48  # Unit Clause-clause subsumption calls : 75
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 0
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 4516
% 0.19/0.48  # Search garbage collected termcells   : 17
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.008 s
% 0.19/0.48  # System time              : 0.001 s
% 0.19/0.48  # Total time               : 0.009 s
% 0.19/0.48  # Maximum resident set size: 1608 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.010 s
% 0.19/0.48  # System time              : 0.003 s
% 0.19/0.48  # Total time               : 0.013 s
% 0.19/0.48  # Maximum resident set size: 1696 pages
% 0.19/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------