↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : BOO013-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:06:58 PM UTC 2026

% Result   : Unsatisfiable 0.22s 0.60s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;  13 RR)
%            Number of literals    :   23 (  22 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
    add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',distributivity1) ).

cnf(c_and_multiplicative_identity,hypothesis,
    add(a,c) = multiplicative_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_and_multiplicative_identity) ).

cnf(multiplicative_id2,axiom,
    multiply(multiplicative_identity,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).

cnf(commutativity_of_add,axiom,
    add(X1,X2) = add(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).

cnf(b_and_multiplicative_identity,hypothesis,
    add(a,b) = multiplicative_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_and_multiplicative_identity) ).

cnf(b_a_additive_identity,hypothesis,
    multiply(a,b) = additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_a_additive_identity) ).

cnf(additive_id1,axiom,
    add(X1,additive_identity) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO003-0.ax',additive_id1) ).

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

cnf(c_a_additive_identity,hypothesis,
    multiply(a,c) = additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_a_additive_identity) ).

cnf(c_0_9,axiom,
    add(multiply(X1,X2),X3) = multiply(add(X1,X3),add(X2,X3)),
    distributivity1 ).

cnf(c_0_10,hypothesis,
    add(a,c) = multiplicative_identity,
    c_and_multiplicative_identity ).

cnf(c_0_11,axiom,
    multiply(multiplicative_identity,X1) = X1,
    multiplicative_id2 ).

cnf(c_0_12,axiom,
    add(X1,X2) = add(X2,X1),
    commutativity_of_add ).

cnf(c_0_13,hypothesis,
    add(a,b) = multiplicative_identity,
    b_and_multiplicative_identity ).

cnf(c_0_14,hypothesis,
    add(c,multiply(a,X1)) = add(X1,c),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).

cnf(c_0_15,hypothesis,
    multiply(a,b) = additive_identity,
    b_a_additive_identity ).

cnf(c_0_16,axiom,
    add(X1,additive_identity) = X1,
    additive_id1 ).

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

cnf(c_0_18,hypothesis,
    add(b,multiply(a,X1)) = add(X1,b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_11]),c_0_12]) ).

cnf(c_0_19,hypothesis,
    multiply(a,c) = additive_identity,
    c_a_additive_identity ).

cnf(c_0_20,hypothesis,
    add(b,c) = c,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    b != c,
    c_0_17 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : BOO013-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n015.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 13:51:08 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.54  Running first-order theorem proving
% 0.22/0.54  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.60  % Version: 3.5.1
% 0.22/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.60  % Starting sh5l with 300s (1) cores
% 0.22/0.60  % sh5l with pid 1624610 completed with status 0
% 0.22/0.60  % Result found by sh5l
% 0.22/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.60  % Starting sh5l with 300s (1) cores
% 0.22/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.60  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.60  % Search class: FUUPM-FFSS21-SFFFFFNN
% 0.22/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.60  % SubtermCWHack with pid 1624615 completed with status 0
% 0.22/0.60  % Result found by SubtermCWHack
% 0.22/0.60  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.60  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.60  % Starting sh5l with 300s (1) cores
% 0.22/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.60  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.60  % Search class: FUUPM-FFSS21-SFFFFFNN
% 0.22/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.60  % Preprocessing time       : 0.002 s
% 0.22/0.60  
% 0.22/0.60  % Proof found!
% 0.22/0.60  % SZS status Unsatisfiable
% 0.22/0.60  % SZS output start CNFRefutation
% See solution above
% 0.22/0.60  % Parsed axioms                        : 19
% 0.22/0.60  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.60  % Initial clauses                      : 19
% 0.22/0.60  % Removed in clause preprocessing      : 0
% 0.22/0.60  % Initial clauses in saturation        : 19
% 0.22/0.60  % Processed clauses                    : 69
% 0.22/0.60  % ...of these trivial                  : 11
% 0.22/0.60  % ...subsumed                          : 2
% 0.22/0.60  % ...remaining for further processing  : 55
% 0.22/0.60  % Other redundant clauses eliminated   : 0
% 0.22/0.60  % Clauses deleted for lack of memory   : 0
% 0.22/0.60  % Backward-subsumed                    : 0
% 0.22/0.60  % Backward-rewritten                   : 2
% 0.22/0.60  % Generated clauses                    : 350
% 0.22/0.60  % ...of the previous two non-redundant : 254
% 0.22/0.60  % ...aggressively subsumed             : 0
% 0.22/0.60  % Contextual simplify-reflections      : 0
% 0.22/0.60  % Paramodulations                      : 350
% 0.22/0.60  % Factorizations                       : 0
% 0.22/0.60  % NegExts                              : 0
% 0.22/0.60  % Equation resolutions                 : 0
% 0.22/0.60  % Disequality decompositions           : 0
% 0.22/0.60  % Total rewrite steps                  : 320
% 0.22/0.60  % ...of those cached                   : 203
% 0.22/0.60  % Propositional unsat checks           : 0
% 0.22/0.60  %    Propositional check models        : 0
% 0.22/0.60  %    Propositional check unsatisfiable : 0
% 0.22/0.60  %    Propositional clauses             : 0
% 0.22/0.60  %    Propositional clauses after purity: 0
% 0.22/0.60  %    Propositional unsat core size     : 0
% 0.22/0.60  %    Propositional preprocessing time  : 0.000
% 0.22/0.60  %    Propositional encoding time       : 0.000
% 0.22/0.60  %    Propositional solver time         : 0.000
% 0.22/0.60  %    Success case prop preproc time    : 0.000
% 0.22/0.60  %    Success case prop encoding time   : 0.000
% 0.22/0.60  %    Success case prop solver time     : 0.000
% 0.22/0.60  % Current number of processed clauses  : 53
% 0.22/0.60  %    Positive orientable unit clauses  : 50
% 0.22/0.60  %    Positive unorientable unit clauses: 2
% 0.22/0.60  %    Negative unit clauses             : 1
% 0.22/0.60  %    Non-unit-clauses                  : 0
% 0.22/0.60  % Current number of unprocessed clauses: 204
% 0.22/0.60  % ...number of literals in the above   : 204
% 0.22/0.60  % Current number of archived formulas  : 0
% 0.22/0.60  % Current number of archived clauses   : 2
% 0.22/0.60  % Clause-clause subsumption calls (NU) : 0
% 0.22/0.60  % Rec. Clause-clause subsumption calls : 0
% 0.22/0.60  % Non-unit clause-clause subsumptions  : 0
% 0.22/0.60  % Unit Clause-clause subsumption calls : 0
% 0.22/0.60  % Rewrite failures with RHS unbound    : 0
% 0.22/0.60  % BW rewrite match attempts            : 26
% 0.22/0.60  % BW rewrite match successes           : 24
% 0.22/0.60  % Condensation attempts                : 0
% 0.22/0.60  % Condensation successes               : 0
% 0.22/0.60  % Termbank termtop insertions          : 3334
% 0.22/0.60  % Search garbage collected termcells   : 2
% 0.22/0.60  
% 0.22/0.60  % -------------------------------------------------
% 0.22/0.60  % User time                : 0.011 s
% 0.22/0.60  % System time              : 0.003 s
% 0.22/0.60  % Total time               : 0.014 s
% 0.22/0.60  % Maximum resident set size: 3640 pages
% 0.22/0.60  
% 0.22/0.60  % -------------------------------------------------
% 0.22/0.60  % User time                : 0.012 s
% 0.22/0.60  % System time              : 0.010 s
% 0.22/0.60  % Total time               : 0.022 s
% 0.22/0.60  % Maximum resident set size: 4608 pages
% 0.22/0.60  % E exiting
%------------------------------------------------------------------------------