TSTP Solution File: CAT002-4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CAT002-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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 18:59:28 EDT 2024

% Result   : Unsatisfiable 0.22s 0.51s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   20 (  10 unt;   0 nHn;  18 RR)
%            Number of literals    :   36 (  35 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cancellation_for_compose1,hypothesis,
    ( X1 = X3
    | compose(a,X1) != X2
    | compose(a,X3) != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cancellation_for_compose1) ).

cnf(ab_h_equals_ab_g,hypothesis,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ab_h_equals_ab_g) ).

cnf(associativity_of_compose,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT004-0.ax',associativity_of_compose) ).

cnf(cancellation_for_compose2,hypothesis,
    ( X1 = X3
    | compose(b,X1) != X2
    | compose(b,X3) != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cancellation_for_compose2) ).

cnf(prove_g_equals_h,negated_conjecture,
    g != h,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_g_equals_h) ).

cnf(c_0_5,hypothesis,
    ( X1 = X3
    | compose(a,X1) != X2
    | compose(a,X3) != X2 ),
    inference(fof_simplification,[status(thm)],[cancellation_for_compose1]) ).

cnf(c_0_6,hypothesis,
    ( X1 = X3
    | compose(a,X1) != X2
    | compose(a,X3) != X2 ),
    c_0_5 ).

cnf(c_0_7,hypothesis,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    ab_h_equals_ab_g ).

cnf(c_0_8,axiom,
    compose(X1,compose(X2,X3)) = compose(compose(X1,X2),X3),
    associativity_of_compose ).

cnf(c_0_9,hypothesis,
    ( X1 = X3
    | compose(b,X1) != X2
    | compose(b,X3) != X2 ),
    inference(fof_simplification,[status(thm)],[cancellation_for_compose2]) ).

cnf(c_0_10,hypothesis,
    ( X1 = X2
    | compose(a,X1) != compose(a,X2) ),
    inference(er,[status(thm)],[c_0_6]) ).

cnf(c_0_11,hypothesis,
    compose(a,compose(b,g)) = compose(a,compose(b,h)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).

cnf(c_0_12,hypothesis,
    ( X1 = X3
    | compose(b,X1) != X2
    | compose(b,X3) != X2 ),
    c_0_9 ).

cnf(c_0_13,hypothesis,
    ( X1 = compose(b,g)
    | compose(a,X1) != compose(a,compose(b,h)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,hypothesis,
    ( X1 = X2
    | compose(b,X1) != compose(b,X2) ),
    inference(er,[status(thm)],[c_0_12]) ).

cnf(c_0_15,hypothesis,
    compose(b,g) = compose(b,h),
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    g != h,
    inference(fof_simplification,[status(thm)],[prove_g_equals_h]) ).

cnf(c_0_17,hypothesis,
    ( X1 = g
    | compose(b,X1) != compose(b,h) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    g != h,
    c_0_16 ).

cnf(c_0_19,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : CAT002-4 : TPTP v8.2.0. Released v1.0.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n005.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sat May 18 11:34:23 EDT 2024
% 0.22/0.35  % CPUTime    : 
% 0.22/0.50  Running first-order model finding
% 0.22/0.50  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.51  # Version: 3.1.0
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51  # Starting sh5l with 300s (1) cores
% 0.22/0.51  # new_bool_3 with pid 11574 completed with status 0
% 0.22/0.51  # Result found by new_bool_3
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51  # Search class: FHUSF-FFSS22-SFFFFFNN
% 0.22/0.51  # partial match(1): FHUSM-FFSS22-SFFFFFNN
% 0.22/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51  # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.51  # G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11578 completed with status 0
% 0.22/0.51  # Result found by G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51  # Search class: FHUSF-FFSS22-SFFFFFNN
% 0.22/0.51  # partial match(1): FHUSM-FFSS22-SFFFFFNN
% 0.22/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51  # Starting G-E--_208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.22/0.51  # Preprocessing time       : 0.001 s
% 0.22/0.51  # Presaturation interreduction done
% 0.22/0.51  
% 0.22/0.51  # Proof found!
% 0.22/0.51  # SZS status Unsatisfiable
% 0.22/0.51  # SZS output start CNFRefutation
% See solution above
% 0.22/0.51  # Parsed axioms                        : 17
% 0.22/0.51  # Removed by relevancy pruning/SinE    : 10
% 0.22/0.51  # Initial clauses                      : 7
% 0.22/0.51  # Removed in clause preprocessing      : 0
% 0.22/0.51  # Initial clauses in saturation        : 7
% 0.22/0.51  # Processed clauses                    : 20
% 0.22/0.51  # ...of these trivial                  : 0
% 0.22/0.51  # ...subsumed                          : 0
% 0.22/0.51  # ...remaining for further processing  : 20
% 0.22/0.51  # Other redundant clauses eliminated   : 2
% 0.22/0.51  # Clauses deleted for lack of memory   : 0
% 0.22/0.51  # Backward-subsumed                    : 0
% 0.22/0.51  # Backward-rewritten                   : 3
% 0.22/0.51  # Generated clauses                    : 13
% 0.22/0.51  # ...of the previous two non-redundant : 11
% 0.22/0.51  # ...aggressively subsumed             : 0
% 0.22/0.51  # Contextual simplify-reflections      : 0
% 0.22/0.51  # Paramodulations                      : 7
% 0.22/0.51  # Factorizations                       : 0
% 0.22/0.51  # NegExts                              : 0
% 0.22/0.51  # Equation resolutions                 : 6
% 0.22/0.51  # Disequality decompositions           : 0
% 0.22/0.51  # Total rewrite steps                  : 11
% 0.22/0.51  # ...of those cached                   : 2
% 0.22/0.51  # Propositional unsat checks           : 0
% 0.22/0.51  #    Propositional check models        : 0
% 0.22/0.51  #    Propositional check unsatisfiable : 0
% 0.22/0.51  #    Propositional clauses             : 0
% 0.22/0.51  #    Propositional clauses after purity: 0
% 0.22/0.51  #    Propositional unsat core size     : 0
% 0.22/0.51  #    Propositional preprocessing time  : 0.000
% 0.22/0.51  #    Propositional encoding time       : 0.000
% 0.22/0.51  #    Propositional solver time         : 0.000
% 0.22/0.51  #    Success case prop preproc time    : 0.000
% 0.22/0.51  #    Success case prop encoding time   : 0.000
% 0.22/0.51  #    Success case prop solver time     : 0.000
% 0.22/0.51  # Current number of processed clauses  : 8
% 0.22/0.51  #    Positive orientable unit clauses  : 4
% 0.22/0.51  #    Positive unorientable unit clauses: 0
% 0.22/0.51  #    Negative unit clauses             : 1
% 0.22/0.51  #    Non-unit-clauses                  : 3
% 0.22/0.51  # Current number of unprocessed clauses: 5
% 0.22/0.51  # ...number of literals in the above   : 8
% 0.22/0.51  # Current number of archived formulas  : 0
% 0.22/0.51  # Current number of archived clauses   : 10
% 0.22/0.51  # Clause-clause subsumption calls (NU) : 2
% 0.22/0.51  # Rec. Clause-clause subsumption calls : 2
% 0.22/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.51  # Unit Clause-clause subsumption calls : 0
% 0.22/0.51  # Rewrite failures with RHS unbound    : 0
% 0.22/0.51  # BW rewrite match attempts            : 3
% 0.22/0.51  # BW rewrite match successes           : 3
% 0.22/0.51  # Condensation attempts                : 0
% 0.22/0.51  # Condensation successes               : 0
% 0.22/0.51  # Termbank termtop insertions          : 349
% 0.22/0.51  # Search garbage collected termcells   : 49
% 0.22/0.51  
% 0.22/0.51  # -------------------------------------------------
% 0.22/0.51  # User time                : 0.003 s
% 0.22/0.51  # System time              : 0.001 s
% 0.22/0.51  # Total time               : 0.004 s
% 0.22/0.51  # Maximum resident set size: 1588 pages
% 0.22/0.51  
% 0.22/0.51  # -------------------------------------------------
% 0.22/0.51  # User time                : 0.003 s
% 0.22/0.51  # System time              : 0.004 s
% 0.22/0.51  # Total time               : 0.007 s
% 0.22/0.51  # Maximum resident set size: 1708 pages
% 0.22/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------