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

View Problem - Process Solution

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

% Computer : n008.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:36:32 EDT 2024

% Result   : Unsatisfiable 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   32 (  19 unt;   0 nHn;  24 RR)
%            Number of literals    :   55 (   9 equ;  26 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   60 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_of_addition1,axiom,
    ( sum(X1,X5,X6)
    | ~ sum(X1,X2,X3)
    | ~ sum(X2,X4,X5)
    | ~ sum(X3,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',associativity_of_addition1) ).

cnf(additive_identity1,axiom,
    sum(additive_identity,X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',additive_identity1) ).

cnf(addition_is_well_defined,axiom,
    ( X3 = X4
    | ~ sum(X1,X2,X3)
    | ~ sum(X1,X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',addition_is_well_defined) ).

cnf(commutativity_of_addition,axiom,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',commutativity_of_addition) ).

cnf(a_plus_c_is_d,hypothesis,
    sum(a,c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_c_is_d) ).

cnf(closure_of_addition,axiom,
    sum(X1,X2,add(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_addition) ).

cnf(a_plus_b_is_d,hypothesis,
    sum(a,b,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_plus_b_is_d) ).

cnf(left_inverse,axiom,
    sum(additive_inverse(X1),X1,additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',left_inverse) ).

cnf(prove_b_equals_c,negated_conjecture,
    b != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_c) ).

cnf(c_0_9,plain,
    ( sum(X1,X5,X6)
    | ~ sum(X1,X2,X3)
    | ~ sum(X2,X4,X5)
    | ~ sum(X3,X4,X6) ),
    inference(fof_simplification,[status(thm)],[associativity_of_addition1]) ).

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

cnf(c_0_11,axiom,
    sum(additive_identity,X1,X1),
    additive_identity1 ).

cnf(c_0_12,plain,
    ( X3 = X4
    | ~ sum(X1,X2,X3)
    | ~ sum(X1,X2,X4) ),
    inference(fof_simplification,[status(thm)],[addition_is_well_defined]) ).

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

cnf(c_0_14,plain,
    ( sum(X1,X2,X3)
    | ~ sum(X1,X4,additive_identity)
    | ~ sum(X4,X3,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,hypothesis,
    sum(a,c,d),
    a_plus_c_is_d ).

cnf(c_0_16,plain,
    ( X3 = X4
    | ~ sum(X1,X2,X3)
    | ~ sum(X1,X2,X4) ),
    c_0_12 ).

cnf(c_0_17,axiom,
    sum(X1,X2,add(X1,X2)),
    closure_of_addition ).

cnf(c_0_18,plain,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    c_0_13 ).

cnf(c_0_19,hypothesis,
    sum(a,b,d),
    a_plus_b_is_d ).

cnf(c_0_20,hypothesis,
    ( sum(X1,d,c)
    | ~ sum(X1,a,additive_identity) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,axiom,
    sum(additive_inverse(X1),X1,additive_identity),
    left_inverse ).

cnf(c_0_22,plain,
    ( X1 = add(X2,X3)
    | ~ sum(X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    sum(X1,X2,add(X2,X1)),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

cnf(c_0_24,hypothesis,
    ( sum(X1,d,b)
    | ~ sum(X1,a,additive_identity) ),
    inference(spm,[status(thm)],[c_0_14,c_0_19]) ).

cnf(c_0_25,hypothesis,
    sum(additive_inverse(a),d,c),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    add(X1,X2) = add(X2,X1),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    b != c,
    inference(fof_simplification,[status(thm)],[prove_b_equals_c]) ).

cnf(c_0_28,hypothesis,
    sum(additive_inverse(a),d,b),
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

cnf(c_0_29,hypothesis,
    add(d,additive_inverse(a)) = c,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    b != c,
    c_0_27 ).

cnf(c_0_31,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_26]),c_0_29]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : RNG002-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.16/0.35  % Computer : n008.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit   : 300
% 0.16/0.35  % WCLimit    : 300
% 0.16/0.35  % DateTime   : Sat May 18 12:17:38 EDT 2024
% 0.16/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  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
% 0.21/0.50  # Version: 3.1.0
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8491 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50  # Starting sh5l with 136s (1) cores
% 0.21/0.50  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 8495 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Unsatisfiable
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 20
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.50  # Initial clauses                      : 20
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 20
% 0.21/0.50  # Processed clauses                    : 124
% 0.21/0.50  # ...of these trivial                  : 12
% 0.21/0.50  # ...subsumed                          : 8
% 0.21/0.50  # ...remaining for further processing  : 104
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 3
% 0.21/0.50  # Generated clauses                    : 325
% 0.21/0.50  # ...of the previous two non-redundant : 184
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 325
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 0
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 195
% 0.21/0.50  # ...of those cached                   : 146
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 81
% 0.21/0.50  #    Positive orientable unit clauses  : 27
% 0.21/0.50  #    Positive unorientable unit clauses: 1
% 0.21/0.50  #    Negative unit clauses             : 1
% 0.21/0.50  #    Non-unit-clauses                  : 52
% 0.21/0.50  # Current number of unprocessed clauses: 95
% 0.21/0.50  # ...number of literals in the above   : 222
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 23
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 597
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 505
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 7
% 0.21/0.50  # Unit Clause-clause subsumption calls : 0
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 65
% 0.21/0.50  # BW rewrite match successes           : 22
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 3819
% 0.21/0.50  # Search garbage collected termcells   : 61
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.009 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.011 s
% 0.21/0.50  # Maximum resident set size: 1640 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.044 s
% 0.21/0.50  # System time              : 0.006 s
% 0.21/0.50  # Total time               : 0.050 s
% 0.21/0.50  # Maximum resident set size: 1712 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------