TSTP Solution File: GRP044-2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GRP044-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:43:36 EDT 2023

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   30 (  15 unt;   0 nHn;  24 RR)
%            Number of literals    :   56 (   0 equ;  28 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(product_substitution3,axiom,
    ( product(X3,X4,X2)
    | ~ equalish(X1,X2)
    | ~ product(X3,X4,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',product_substitution3) ).

cnf(left_identity,axiom,
    product(identity,X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',left_identity) ).

cnf(total_function2,axiom,
    ( equalish(X3,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',total_function2) ).

cnf(total_function1,axiom,
    product(X1,X2,multiply(X1,X2)),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',total_function1) ).

cnf(a_equals_b,hypothesis,
    equalish(a,b),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',a_equals_b) ).

cnf(associativity2,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',associativity2) ).

cnf(product_with_a,hypothesis,
    product(a,c,result),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',product_with_a) ).

cnf(prove_product_with_b,negated_conjecture,
    ~ product(b,c,result),
    file('/export/starexec/sandbox2/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p',prove_product_with_b) ).

cnf(c_0_8,axiom,
    ( product(X3,X4,X2)
    | ~ equalish(X1,X2)
    | ~ product(X3,X4,X1) ),
    product_substitution3 ).

cnf(c_0_9,axiom,
    product(identity,X1,X1),
    left_identity ).

cnf(c_0_10,axiom,
    ( equalish(X3,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    total_function2 ).

cnf(c_0_11,plain,
    ( product(identity,X1,X2)
    | ~ equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( equalish(X1,X2)
    | ~ equalish(X3,X2)
    | ~ product(identity,X3,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,plain,
    ( equalish(X1,X2)
    | ~ product(identity,X2,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_14,axiom,
    product(X1,X2,multiply(X1,X2)),
    total_function1 ).

cnf(c_0_15,plain,
    ( equalish(X1,X2)
    | ~ equalish(X3,X2)
    | ~ equalish(X3,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_16,hypothesis,
    equalish(a,b),
    a_equals_b ).

cnf(c_0_17,plain,
    ( equalish(X1,X2)
    | ~ equalish(X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_11]) ).

cnf(c_0_18,plain,
    equalish(multiply(identity,X1),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    associativity2 ).

cnf(c_0_20,hypothesis,
    product(a,c,result),
    product_with_a ).

cnf(c_0_21,hypothesis,
    ( equalish(X1,b)
    | ~ equalish(a,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,plain,
    equalish(X1,multiply(identity,X1)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,hypothesis,
    ( product(X1,c,X2)
    | ~ product(X3,result,X2)
    | ~ product(X3,a,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( product(X1,X2,X3)
    | ~ equalish(multiply(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_25,hypothesis,
    equalish(multiply(identity,a),b),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,hypothesis,
    ( product(X1,c,result)
    | ~ product(identity,a,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_9]) ).

cnf(c_0_27,hypothesis,
    product(identity,a,b),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ~ product(b,c,result),
    prove_product_with_b ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP044-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n020.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   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Oct  3 02:44:46 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/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/tmp/tmp.Rg3OKmdIS0/E---3.1_31311.p
% 0.19/0.49  # Version: 3.1pre001
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31390 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  # Starting new_bool_3 with 136s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 136s (1) cores
% 0.19/0.49  # Starting sh5l with 136s (1) cores
% 0.19/0.49  # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 31398 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FHUNS-FFSF21-SFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 10
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 10
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 10
% 0.19/0.49  # Processed clauses                    : 58
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 6
% 0.19/0.49  # ...remaining for further processing  : 52
% 0.19/0.49  # Other redundant clauses eliminated   : 0
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 2
% 0.19/0.49  # Backward-rewritten                   : 0
% 0.19/0.49  # Generated clauses                    : 118
% 0.19/0.49  # ...of the previous two non-redundant : 89
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 118
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 0
% 0.19/0.49  # Total rewrite steps                  : 27
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 40
% 0.19/0.49  #    Positive orientable unit clauses  : 16
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 1
% 0.19/0.49  #    Non-unit-clauses                  : 23
% 0.19/0.49  # Current number of unprocessed clauses: 49
% 0.19/0.49  # ...number of literals in the above   : 126
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 12
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 50
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 45
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 8
% 0.19/0.49  # Unit Clause-clause subsumption calls : 2
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 11
% 0.19/0.49  # BW rewrite match successes           : 0
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 1368
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.005 s
% 0.19/0.49  # System time              : 0.001 s
% 0.19/0.49  # Total time               : 0.006 s
% 0.19/0.49  # Maximum resident set size: 1592 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.022 s
% 0.19/0.49  # System time              : 0.005 s
% 0.19/0.49  # Total time               : 0.027 s
% 0.19/0.49  # Maximum resident set size: 1676 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------