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

View Problem - Process Solution

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

% Computer : n010.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 : Tue May 21 02:44:34 EDT 2024

% Result   : Unsatisfiable 2.17s 0.64s
% Output   : CNFRefutation 2.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (  15 unt;   4 nHn;  20 RR)
%            Number of literals    :   56 (   5 equ;  30 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-4 aty)
%            Number of variables   :   47 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_8,negated_conjecture,
    ( hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | X1 = X2
    | ~ hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(X3,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ c_Relation_Ototal__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Oirrefl(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Otrans(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_8) ).

cnf(cls_mem__def_0,axiom,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(c_in(X2,X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ hBOOL(c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_Relation_Ototal__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_Relation_Otrans(hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_Relation_Oirrefl(hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_irrefl__def_0,axiom,
    ( ~ hBOOL(c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)))
    | ~ c_Relation_Oirrefl(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_irrefl__def_0) ).

cnf(cls_mem__def_1,axiom,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_conjecture_3,negated_conjecture,
    hBOOL(c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(c_0_9,negated_conjecture,
    ( hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | X1 = X2
    | ~ hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(X3,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ c_Relation_Ototal__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Oirrefl(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Otrans(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_8]) ).

cnf(c_0_10,plain,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(c_in(X2,X1,X3)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_11,negated_conjecture,
    ~ hBOOL(c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_12,negated_conjecture,
    ( hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(X3),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | X1 = X2
    | ~ hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(X3,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ c_Relation_Ototal__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Oirrefl(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt)
    | ~ c_Relation_Otrans(hAPP(X3,v_Pa(X3)),tc_Arrow__Order__Mirabelle_Oalt) ),
    c_0_9 ).

cnf(c_0_13,negated_conjecture,
    c_Relation_Ototal__on(c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oalt,tc_bool)),hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    cls_conjecture_2 ).

cnf(c_0_14,negated_conjecture,
    c_Relation_Otrans(hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    cls_conjecture_0 ).

cnf(c_0_15,negated_conjecture,
    c_Relation_Oirrefl(hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    cls_conjecture_1 ).

cnf(c_0_16,plain,
    ( ~ hBOOL(c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)))
    | ~ c_Relation_Oirrefl(X3,X2) ),
    inference(fof_simplification,[status(thm)],[cls_irrefl__def_0]) ).

cnf(c_0_17,plain,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_18,plain,
    ( hBOOL(hAPP(X1,X2))
    | ~ hBOOL(c_in(X2,X1,X3)) ),
    c_0_10 ).

cnf(c_0_19,negated_conjecture,
    hBOOL(c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    cls_conjecture_3 ).

cnf(c_0_20,negated_conjecture,
    ~ hBOOL(c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    c_0_11 ).

cnf(c_0_21,negated_conjecture,
    ( X1 = X2
    | hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | ~ hBOOL(c_in(c_Pair(X1,X2,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

cnf(c_0_22,plain,
    ( ~ hBOOL(c_in(c_Pair(X1,X1,X2,X2),X3,tc_prod(X2,X2)))
    | ~ c_Relation_Oirrefl(X3,X2) ),
    c_0_16 ).

cnf(c_0_23,plain,
    ( hBOOL(c_in(X1,X2,X3))
    | ~ hBOOL(hAPP(X2,X1)) ),
    c_0_17 ).

cnf(c_0_24,negated_conjecture,
    hBOOL(hAPP(hAPP(v_P,v_i),c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    v_b = v_a,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_19])]) ).

cnf(c_0_26,plain,
    ( ~ c_Relation_Oirrefl(X1,X2)
    | ~ hBOOL(hAPP(X1,c_Pair(X3,X3,X2,X2))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    hBOOL(hAPP(hAPP(v_P,v_i),c_Pair(v_a,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : SCT024-1 : TPTP v8.2.0. Released v4.1.0.
% 0.06/0.08  % Command    : run_E %s %d THM
% 0.06/0.26  % Computer : n010.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit   : 300
% 0.06/0.26  % WCLimit    : 300
% 0.06/0.26  % DateTime   : Mon May 20 00:24:07 EDT 2024
% 0.06/0.26  % CPUTime    : 
% 0.10/0.34  Running first-order theorem proving
% 0.10/0.34  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.17/0.64  # Version: 3.1.0
% 2.17/0.64  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.17/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.64  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.17/0.64  # Starting new_bool_3 with 600s (2) cores
% 2.17/0.64  # Starting new_bool_1 with 300s (1) cores
% 2.17/0.64  # Starting sh5l with 300s (1) cores
% 2.17/0.64  # sh5l with pid 4696 completed with status 0
% 2.17/0.64  # Result found by sh5l
% 2.17/0.64  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.17/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.64  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.17/0.64  # Starting new_bool_3 with 600s (2) cores
% 2.17/0.64  # Starting new_bool_1 with 300s (1) cores
% 2.17/0.64  # Starting sh5l with 300s (1) cores
% 2.17/0.64  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.17/0.64  # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.17/0.64  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.17/0.64  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.17/0.64  # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 4700 completed with status 0
% 2.17/0.64  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 2.17/0.64  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.17/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.64  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.17/0.64  # Starting new_bool_3 with 600s (2) cores
% 2.17/0.64  # Starting new_bool_1 with 300s (1) cores
% 2.17/0.64  # Starting sh5l with 300s (1) cores
% 2.17/0.64  # SinE strategy is gf500_gu_R04_F100_L20000
% 2.17/0.64  # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.17/0.64  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 2.17/0.64  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 2.17/0.64  # Preprocessing time       : 0.028 s
% 2.17/0.64  
% 2.17/0.64  # Proof found!
% 2.17/0.64  # SZS status Unsatisfiable
% 2.17/0.64  # SZS output start CNFRefutation
% See solution above
% 2.17/0.64  # Parsed axioms                        : 713
% 2.17/0.64  # Removed by relevancy pruning/SinE    : 109
% 2.17/0.64  # Initial clauses                      : 604
% 2.17/0.64  # Removed in clause preprocessing      : 0
% 2.17/0.64  # Initial clauses in saturation        : 604
% 2.17/0.64  # Processed clauses                    : 1125
% 2.17/0.64  # ...of these trivial                  : 46
% 2.17/0.64  # ...subsumed                          : 287
% 2.17/0.64  # ...remaining for further processing  : 792
% 2.17/0.64  # Other redundant clauses eliminated   : 3
% 2.17/0.64  # Clauses deleted for lack of memory   : 0
% 2.17/0.64  # Backward-subsumed                    : 9
% 2.17/0.64  # Backward-rewritten                   : 12
% 2.17/0.64  # Generated clauses                    : 12318
% 2.17/0.64  # ...of the previous two non-redundant : 10794
% 2.17/0.64  # ...aggressively subsumed             : 0
% 2.17/0.64  # Contextual simplify-reflections      : 1
% 2.17/0.64  # Paramodulations                      : 12306
% 2.17/0.64  # Factorizations                       : 0
% 2.17/0.64  # NegExts                              : 0
% 2.17/0.64  # Equation resolutions                 : 12
% 2.17/0.64  # Disequality decompositions           : 0
% 2.17/0.64  # Total rewrite steps                  : 3555
% 2.17/0.64  # ...of those cached                   : 2338
% 2.17/0.64  # Propositional unsat checks           : 0
% 2.17/0.64  #    Propositional check models        : 0
% 2.17/0.64  #    Propositional check unsatisfiable : 0
% 2.17/0.64  #    Propositional clauses             : 0
% 2.17/0.64  #    Propositional clauses after purity: 0
% 2.17/0.64  #    Propositional unsat core size     : 0
% 2.17/0.64  #    Propositional preprocessing time  : 0.000
% 2.17/0.64  #    Propositional encoding time       : 0.000
% 2.17/0.64  #    Propositional solver time         : 0.000
% 2.17/0.64  #    Success case prop preproc time    : 0.000
% 2.17/0.64  #    Success case prop encoding time   : 0.000
% 2.17/0.64  #    Success case prop solver time     : 0.000
% 2.17/0.64  # Current number of processed clauses  : 771
% 2.17/0.64  #    Positive orientable unit clauses  : 199
% 2.17/0.64  #    Positive unorientable unit clauses: 14
% 2.17/0.64  #    Negative unit clauses             : 24
% 2.17/0.64  #    Non-unit-clauses                  : 534
% 2.17/0.64  # Current number of unprocessed clauses: 10261
% 2.17/0.64  # ...number of literals in the above   : 25204
% 2.17/0.64  # Current number of archived formulas  : 0
% 2.17/0.64  # Current number of archived clauses   : 21
% 2.17/0.64  # Clause-clause subsumption calls (NU) : 37501
% 2.17/0.64  # Rec. Clause-clause subsumption calls : 26177
% 2.17/0.64  # Non-unit clause-clause subsumptions  : 224
% 2.17/0.64  # Unit Clause-clause subsumption calls : 4130
% 2.17/0.64  # Rewrite failures with RHS unbound    : 0
% 2.17/0.64  # BW rewrite match attempts            : 298
% 2.17/0.64  # BW rewrite match successes           : 76
% 2.17/0.64  # Condensation attempts                : 0
% 2.17/0.64  # Condensation successes               : 0
% 2.17/0.64  # Termbank termtop insertions          : 278168
% 2.17/0.64  # Search garbage collected termcells   : 1674
% 2.17/0.64  
% 2.17/0.64  # -------------------------------------------------
% 2.17/0.64  # User time                : 0.260 s
% 2.17/0.64  # System time              : 0.016 s
% 2.17/0.64  # Total time               : 0.276 s
% 2.17/0.64  # Maximum resident set size: 3200 pages
% 2.17/0.64  
% 2.17/0.64  # -------------------------------------------------
% 2.17/0.64  # User time                : 0.269 s
% 2.17/0.64  # System time              : 0.019 s
% 2.17/0.64  # Total time               : 0.288 s
% 2.17/0.64  # Maximum resident set size: 2292 pages
% 2.17/0.64  % E---3.1 exiting
% 2.17/0.64  % E exiting
%------------------------------------------------------------------------------