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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---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 : n021.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:45:25 EDT 2024

% Result   : Unsatisfiable 2.70s 0.81s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  14 unt;   3 nHn;  14 RR)
%            Number of literals    :   38 (   4 equ;  21 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   :   24 (   6 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_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_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(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(c_0_7,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_8,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_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) ),
    c_0_7 ).

cnf(c_0_10,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_11,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_12,negated_conjecture,
    c_Relation_Otrans(hAPP(v_P,X1),tc_Arrow__Order__Mirabelle_Oalt),
    cls_conjecture_0 ).

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

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

cnf(c_0_15,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_16,negated_conjecture,
    v_b = v_a,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13])]),c_0_14]) ).

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

cnf(c_0_18,negated_conjecture,
    hBOOL(c_in(c_Pair(v_a,v_a,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(spm,[status(thm)],[c_0_10,c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SCT024-1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n021.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   : Mon May 20 00:24:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  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
% 2.70/0.81  # Version: 3.1.0
% 2.70/0.81  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.70/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/0.81  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.70/0.81  # Starting new_bool_3 with 600s (2) cores
% 2.70/0.81  # Starting new_bool_1 with 300s (1) cores
% 2.70/0.81  # Starting sh5l with 300s (1) cores
% 2.70/0.81  # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with pid 11989 completed with status 0
% 2.70/0.81  # Result found by G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S
% 2.70/0.81  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.70/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/0.81  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.70/0.81  # No SInE strategy applied
% 2.70/0.81  # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.70/0.81  # Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 2.70/0.81  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 90s (1) cores
% 2.70/0.81  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 2.70/0.81  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 2.70/0.81  # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 2.70/0.81  # U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 12000 completed with status 0
% 2.70/0.81  # Result found by U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 2.70/0.81  # Preprocessing class: FSLMSMSMSSSNFFN.
% 2.70/0.81  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/0.81  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 2.70/0.81  # No SInE strategy applied
% 2.70/0.81  # Search class: FGHSM-FSLM32-DFFFFFNN
% 2.70/0.81  # Scheduled 13 strats onto 4 cores with 1200 seconds (1200 total)
% 2.70/0.81  # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 90s (1) cores
% 2.70/0.81  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 121s (1) cores
% 2.70/0.81  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 90s (1) cores
% 2.70/0.81  # Starting U----_206c_05_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 90s (1) cores
% 2.70/0.81  # Preprocessing time       : 0.009 s
% 2.70/0.81  # Presaturation interreduction done
% 2.70/0.81  
% 2.70/0.81  # Proof found!
% 2.70/0.81  # SZS status Unsatisfiable
% 2.70/0.81  # SZS output start CNFRefutation
% See solution above
% 2.70/0.81  # Parsed axioms                        : 713
% 2.70/0.81  # Removed by relevancy pruning/SinE    : 0
% 2.70/0.81  # Initial clauses                      : 713
% 2.70/0.81  # Removed in clause preprocessing      : 4
% 2.70/0.81  # Initial clauses in saturation        : 709
% 2.70/0.81  # Processed clauses                    : 1825
% 2.70/0.81  # ...of these trivial                  : 67
% 2.70/0.81  # ...subsumed                          : 370
% 2.70/0.81  # ...remaining for further processing  : 1388
% 2.70/0.81  # Other redundant clauses eliminated   : 35
% 2.70/0.81  # Clauses deleted for lack of memory   : 0
% 2.70/0.81  # Backward-subsumed                    : 8
% 2.70/0.81  # Backward-rewritten                   : 9
% 2.70/0.81  # Generated clauses                    : 12941
% 2.70/0.81  # ...of the previous two non-redundant : 11249
% 2.70/0.81  # ...aggressively subsumed             : 0
% 2.70/0.81  # Contextual simplify-reflections      : 0
% 2.70/0.81  # Paramodulations                      : 12899
% 2.70/0.81  # Factorizations                       : 0
% 2.70/0.81  # NegExts                              : 0
% 2.70/0.81  # Equation resolutions                 : 42
% 2.70/0.81  # Disequality decompositions           : 0
% 2.70/0.81  # Total rewrite steps                  : 4559
% 2.70/0.81  # ...of those cached                   : 3060
% 2.70/0.81  # Propositional unsat checks           : 0
% 2.70/0.81  #    Propositional check models        : 0
% 2.70/0.81  #    Propositional check unsatisfiable : 0
% 2.70/0.81  #    Propositional clauses             : 0
% 2.70/0.81  #    Propositional clauses after purity: 0
% 2.70/0.81  #    Propositional unsat core size     : 0
% 2.70/0.81  #    Propositional preprocessing time  : 0.000
% 2.70/0.81  #    Propositional encoding time       : 0.000
% 2.70/0.81  #    Propositional solver time         : 0.000
% 2.70/0.81  #    Success case prop preproc time    : 0.000
% 2.70/0.81  #    Success case prop encoding time   : 0.000
% 2.70/0.81  #    Success case prop solver time     : 0.000
% 2.70/0.81  # Current number of processed clauses  : 776
% 2.70/0.81  #    Positive orientable unit clauses  : 187
% 2.70/0.81  #    Positive unorientable unit clauses: 16
% 2.70/0.81  #    Negative unit clauses             : 42
% 2.70/0.81  #    Non-unit-clauses                  : 531
% 2.70/0.81  # Current number of unprocessed clauses: 10684
% 2.70/0.81  # ...number of literals in the above   : 25209
% 2.70/0.81  # Current number of archived formulas  : 0
% 2.70/0.81  # Current number of archived clauses   : 613
% 2.70/0.81  # Clause-clause subsumption calls (NU) : 55670
% 2.70/0.81  # Rec. Clause-clause subsumption calls : 42120
% 2.70/0.81  # Non-unit clause-clause subsumptions  : 147
% 2.70/0.81  # Unit Clause-clause subsumption calls : 3581
% 2.70/0.81  # Rewrite failures with RHS unbound    : 0
% 2.70/0.81  # BW rewrite match attempts            : 572
% 2.70/0.81  # BW rewrite match successes           : 116
% 2.70/0.81  # Condensation attempts                : 0
% 2.70/0.81  # Condensation successes               : 0
% 2.70/0.81  # Termbank termtop insertions          : 307214
% 2.70/0.81  # Search garbage collected termcells   : 1251
% 2.70/0.81  
% 2.70/0.81  # -------------------------------------------------
% 2.70/0.81  # User time                : 0.285 s
% 2.70/0.81  # System time              : 0.013 s
% 2.70/0.81  # Total time               : 0.298 s
% 2.70/0.81  # Maximum resident set size: 3224 pages
% 2.70/0.81  
% 2.70/0.81  # -------------------------------------------------
% 2.70/0.81  # User time                : 1.091 s
% 2.70/0.81  # System time              : 0.065 s
% 2.70/0.81  # Total time               : 1.156 s
% 2.70/0.81  # Maximum resident set size: 2296 pages
% 2.70/0.81  % E---3.1 exiting
%------------------------------------------------------------------------------