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

View Problem - Process Solution

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

% Computer : n013.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 : Sat May  4 09:14:55 EDT 2024

% Result   : Unsatisfiable 1.21s 0.58s
% Output   : CNFRefutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   22 (  13 unt;   0 nHn;  17 RR)
%            Number of literals    :   43 (   0 equ;  24 neg)
%            Maximal clause size   :    5 (   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-1 aty)
%            Number of variables   :   45 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X6,X7) ),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',distributivity1) ).

cnf(commutativity_of_addition,axiom,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',commutativity_of_addition) ).

cnf(multiplicative_identity2,axiom,
    product(X1,additive_identity,additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',multiplicative_identity2) ).

cnf(additive_inverse2,axiom,
    sum(X1,additive_inverse(X1),additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',additive_inverse2) ).

cnf(a_inverse_times_b,hypothesis,
    product(a,additive_inverse(b),c),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',a_inverse_times_b) ).

cnf(prove_sum_is_additive_identity,negated_conjecture,
    ~ sum(c,d,additive_identity),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',prove_sum_is_additive_identity) ).

cnf(a_times_b,hypothesis,
    product(a,b,d),
    file('/export/starexec/sandbox/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p',a_times_b) ).

cnf(c_0_7,plain,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X6,X7) ),
    inference(fof_simplification,[status(thm)],[distributivity1]) ).

cnf(c_0_8,plain,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).

cnf(c_0_9,plain,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X6,X7) ),
    c_0_7 ).

cnf(c_0_10,axiom,
    product(X1,additive_identity,additive_identity),
    multiplicative_identity2 ).

cnf(c_0_11,plain,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    c_0_8 ).

cnf(c_0_12,axiom,
    sum(X1,additive_inverse(X1),additive_identity),
    additive_inverse2 ).

cnf(c_0_13,plain,
    ( sum(X1,X2,additive_identity)
    | ~ product(X3,X4,X2)
    | ~ product(X3,X5,X1)
    | ~ sum(X5,X4,additive_identity) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    sum(additive_inverse(X1),X1,additive_identity),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( sum(X1,X2,additive_identity)
    | ~ product(X3,additive_inverse(X4),X1)
    | ~ product(X3,X4,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,hypothesis,
    product(a,additive_inverse(b),c),
    a_inverse_times_b ).

cnf(c_0_17,negated_conjecture,
    ~ sum(c,d,additive_identity),
    inference(fof_simplification,[status(thm)],[prove_sum_is_additive_identity]) ).

cnf(c_0_18,hypothesis,
    ( sum(c,X1,additive_identity)
    | ~ product(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,hypothesis,
    product(a,b,d),
    a_times_b ).

cnf(c_0_20,negated_conjecture,
    ~ sum(c,d,additive_identity),
    c_0_17 ).

cnf(c_0_21,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : RNG037-2 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n013.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 11:24:18 EDT 2024
% 0.10/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  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/tmp/tmp.dlJ7cNAqs8/E---3.1_9943.p
% 1.21/0.58  # Version: 3.1.0
% 1.21/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.58  # Starting new_bool_3 with 300s (1) cores
% 1.21/0.58  # Starting new_bool_1 with 300s (1) cores
% 1.21/0.58  # Starting sh5l with 300s (1) cores
% 1.21/0.58  # new_bool_3 with pid 10022 completed with status 0
% 1.21/0.58  # Result found by new_bool_3
% 1.21/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.58  # Starting new_bool_3 with 300s (1) cores
% 1.21/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.21/0.58  # Search class: FHUNM-FFMF11-SFFFFFNN
% 1.21/0.58  # partial match(1): FHUNM-FFMF21-SFFFFFNN
% 1.21/0.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.21/0.58  # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 181s (1) cores
% 1.21/0.58  # G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with pid 10027 completed with status 0
% 1.21/0.58  # Result found by G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A
% 1.21/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.21/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.21/0.58  # Starting new_bool_3 with 300s (1) cores
% 1.21/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.21/0.58  # Search class: FHUNM-FFMF11-SFFFFFNN
% 1.21/0.58  # partial match(1): FHUNM-FFMF21-SFFFFFNN
% 1.21/0.58  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.21/0.58  # Starting G-E--_107_C12_02_nc_F1_PI_AE_Q4_CS_SP_PS_S064A with 181s (1) cores
% 1.21/0.58  # Preprocessing time       : 0.001 s
% 1.21/0.58  # Presaturation interreduction done
% 1.21/0.58  
% 1.21/0.58  # Proof found!
% 1.21/0.58  # SZS status Unsatisfiable
% 1.21/0.58  # SZS output start CNFRefutation
% See solution above
% 1.21/0.58  # Parsed axioms                        : 29
% 1.21/0.58  # Removed by relevancy pruning/SinE    : 4
% 1.21/0.58  # Initial clauses                      : 25
% 1.21/0.58  # Removed in clause preprocessing      : 0
% 1.21/0.58  # Initial clauses in saturation        : 25
% 1.21/0.58  # Processed clauses                    : 1859
% 1.21/0.58  # ...of these trivial                  : 477
% 1.21/0.58  # ...subsumed                          : 422
% 1.21/0.58  # ...remaining for further processing  : 960
% 1.21/0.58  # Other redundant clauses eliminated   : 0
% 1.21/0.58  # Clauses deleted for lack of memory   : 0
% 1.21/0.58  # Backward-subsumed                    : 73
% 1.21/0.58  # Backward-rewritten                   : 15
% 1.21/0.58  # Generated clauses                    : 13165
% 1.21/0.58  # ...of the previous two non-redundant : 7008
% 1.21/0.58  # ...aggressively subsumed             : 0
% 1.21/0.58  # Contextual simplify-reflections      : 0
% 1.21/0.58  # Paramodulations                      : 13165
% 1.21/0.58  # Factorizations                       : 0
% 1.21/0.58  # NegExts                              : 0
% 1.21/0.58  # Equation resolutions                 : 0
% 1.21/0.58  # Disequality decompositions           : 0
% 1.21/0.58  # Total rewrite steps                  : 6683
% 1.21/0.58  # ...of those cached                   : 6249
% 1.21/0.58  # Propositional unsat checks           : 0
% 1.21/0.58  #    Propositional check models        : 0
% 1.21/0.58  #    Propositional check unsatisfiable : 0
% 1.21/0.58  #    Propositional clauses             : 0
% 1.21/0.58  #    Propositional clauses after purity: 0
% 1.21/0.58  #    Propositional unsat core size     : 0
% 1.21/0.58  #    Propositional preprocessing time  : 0.000
% 1.21/0.58  #    Propositional encoding time       : 0.000
% 1.21/0.58  #    Propositional solver time         : 0.000
% 1.21/0.58  #    Success case prop preproc time    : 0.000
% 1.21/0.58  #    Success case prop encoding time   : 0.000
% 1.21/0.58  #    Success case prop solver time     : 0.000
% 1.21/0.58  # Current number of processed clauses  : 847
% 1.21/0.58  #    Positive orientable unit clauses  : 107
% 1.21/0.58  #    Positive unorientable unit clauses: 0
% 1.21/0.58  #    Negative unit clauses             : 1
% 1.21/0.58  #    Non-unit-clauses                  : 739
% 1.21/0.58  # Current number of unprocessed clauses: 5059
% 1.21/0.58  # ...number of literals in the above   : 9469
% 1.21/0.58  # Current number of archived formulas  : 0
% 1.21/0.58  # Current number of archived clauses   : 113
% 1.21/0.58  # Clause-clause subsumption calls (NU) : 63064
% 1.21/0.58  # Rec. Clause-clause subsumption calls : 57326
% 1.21/0.58  # Non-unit clause-clause subsumptions  : 495
% 1.21/0.58  # Unit Clause-clause subsumption calls : 59
% 1.21/0.58  # Rewrite failures with RHS unbound    : 0
% 1.21/0.58  # BW rewrite match attempts            : 814
% 1.21/0.58  # BW rewrite match successes           : 15
% 1.21/0.58  # Condensation attempts                : 0
% 1.21/0.58  # Condensation successes               : 0
% 1.21/0.58  # Termbank termtop insertions          : 160558
% 1.21/0.58  # Search garbage collected termcells   : 104
% 1.21/0.58  
% 1.21/0.58  # -------------------------------------------------
% 1.21/0.58  # User time                : 0.135 s
% 1.21/0.58  # System time              : 0.002 s
% 1.21/0.58  # Total time               : 0.137 s
% 1.21/0.58  # Maximum resident set size: 1784 pages
% 1.21/0.58  
% 1.21/0.58  # -------------------------------------------------
% 1.21/0.58  # User time                : 0.136 s
% 1.21/0.58  # System time              : 0.005 s
% 1.21/0.58  # Total time               : 0.140 s
% 1.21/0.58  # Maximum resident set size: 1712 pages
% 1.21/0.58  % E---3.1 exiting
%------------------------------------------------------------------------------