↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n019.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:55 PM UTC 2026

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

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

cnf(additive_inverse1,axiom,
    add(X1,inverse(X1)) = multiplicative_identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_inverse1) ).

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

cnf(commutativity_of_multiply,axiom,
    multiply(X1,X2) = multiply(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_multiply) ).

cnf(prove_right_identity,negated_conjecture,
    multiply(a,additive_identity) != additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_identity) ).

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

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

cnf(distributivity2,axiom,
    multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity2) ).

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

cnf(c_0_9,axiom,
    add(X1,inverse(X1)) = multiplicative_identity,
    additive_inverse1 ).

cnf(c_0_10,axiom,
    multiply(X1,multiplicative_identity) = X1,
    multiplicative_id1 ).

cnf(c_0_11,axiom,
    multiply(X1,X2) = multiply(X2,X1),
    commutativity_of_multiply ).

cnf(c_0_12,plain,
    add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_13,plain,
    multiply(multiplicative_identity,X1) = X1,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    multiply(a,additive_identity) != additive_identity,
    inference(fof_simplification,[status(thm)],[prove_right_identity]) ).

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

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

cnf(c_0_17,axiom,
    multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
    distributivity2 ).

cnf(c_0_18,plain,
    add(X1,multiplicative_identity) = multiplicative_identity,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    multiply(a,additive_identity) != additive_identity,
    c_0_14 ).

cnf(c_0_20,plain,
    add(additive_identity,X1) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    add(X1,multiply(X1,X2)) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_18]),c_0_10]),c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    multiply(additive_identity,a) != additive_identity,
    inference(rw,[status(thm)],[c_0_19,c_0_11]) ).

cnf(c_0_23,plain,
    multiply(additive_identity,X1) = additive_identity,
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : BOO006-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34  % Computer : n019.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 13:47:34 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.42  Running first-order theorem proving
% 0.18/0.42  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.18/0.48  % Version: 3.5.1
% 0.18/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  % Starting sh5l with 300s (1) cores
% 0.18/0.48  % new_bool_3 with pid 2735262 completed with status 0
% 0.18/0.48  % Result found by new_bool_3
% 0.18/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.48  % SubtermCWHack with pid 2735268 completed with status 0
% 0.18/0.48  % Result found by SubtermCWHack
% 0.18/0.48  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/0.48  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.18/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.48  % Preprocessing time       : 0.002 s
% 0.18/0.48  
% 0.18/0.48  % Proof found!
% 0.18/0.48  % SZS status Unsatisfiable
% 0.18/0.48  % SZS output start CNFRefutation
% See solution above
% 0.18/0.48  % Parsed axioms                        : 9
% 0.18/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.18/0.48  % Initial clauses                      : 9
% 0.18/0.48  % Removed in clause preprocessing      : 0
% 0.18/0.48  % Initial clauses in saturation        : 9
% 0.18/0.48  % Processed clauses                    : 24
% 0.18/0.48  % ...of these trivial                  : 4
% 0.18/0.48  % ...subsumed                          : 0
% 0.18/0.48  % ...remaining for further processing  : 20
% 0.18/0.48  % Other redundant clauses eliminated   : 0
% 0.18/0.48  % Clauses deleted for lack of memory   : 0
% 0.18/0.48  % Backward-subsumed                    : 0
% 0.18/0.48  % Backward-rewritten                   : 2
% 0.18/0.48  % Generated clauses                    : 81
% 0.18/0.48  % ...of the previous two non-redundant : 49
% 0.18/0.48  % ...aggressively subsumed             : 0
% 0.18/0.48  % Contextual simplify-reflections      : 0
% 0.18/0.48  % Paramodulations                      : 81
% 0.18/0.48  % Factorizations                       : 0
% 0.18/0.48  % NegExts                              : 0
% 0.18/0.48  % Equation resolutions                 : 0
% 0.18/0.48  % Disequality decompositions           : 0
% 0.18/0.48  % Total rewrite steps                  : 65
% 0.18/0.48  % ...of those cached                   : 31
% 0.18/0.48  % Propositional unsat checks           : 0
% 0.18/0.48  %    Propositional check models        : 0
% 0.18/0.48  %    Propositional check unsatisfiable : 0
% 0.18/0.48  %    Propositional clauses             : 0
% 0.18/0.48  %    Propositional clauses after purity: 0
% 0.18/0.48  %    Propositional unsat core size     : 0
% 0.18/0.48  %    Propositional preprocessing time  : 0.000
% 0.18/0.48  %    Propositional encoding time       : 0.000
% 0.18/0.48  %    Propositional solver time         : 0.000
% 0.18/0.48  %    Success case prop preproc time    : 0.000
% 0.18/0.48  %    Success case prop encoding time   : 0.000
% 0.18/0.48  %    Success case prop solver time     : 0.000
% 0.18/0.48  % Current number of processed clauses  : 18
% 0.18/0.48  %    Positive orientable unit clauses  : 16
% 0.18/0.48  %    Positive unorientable unit clauses: 2
% 0.18/0.48  %    Negative unit clauses             : 0
% 0.18/0.48  %    Non-unit-clauses                  : 0
% 0.18/0.48  % Current number of unprocessed clauses: 34
% 0.18/0.48  % ...number of literals in the above   : 34
% 0.18/0.48  % Current number of archived formulas  : 0
% 0.18/0.48  % Current number of archived clauses   : 2
% 0.18/0.48  % Clause-clause subsumption calls (NU) : 0
% 0.18/0.48  % Rec. Clause-clause subsumption calls : 0
% 0.18/0.48  % Non-unit clause-clause subsumptions  : 0
% 0.18/0.48  % Unit Clause-clause subsumption calls : 0
% 0.18/0.48  % Rewrite failures with RHS unbound    : 0
% 0.18/0.48  % BW rewrite match attempts            : 23
% 0.18/0.48  % BW rewrite match successes           : 11
% 0.18/0.48  % Condensation attempts                : 0
% 0.18/0.48  % Condensation successes               : 0
% 0.18/0.48  % Termbank termtop insertions          : 610
% 0.18/0.48  % Search garbage collected termcells   : 2
% 0.18/0.48  
% 0.18/0.48  % -------------------------------------------------
% 0.18/0.48  % User time                : 0.005 s
% 0.18/0.48  % System time              : 0.003 s
% 0.18/0.48  % Total time               : 0.008 s
% 0.18/0.48  % Maximum resident set size: 3328 pages
% 0.18/0.48  
% 0.18/0.48  % -------------------------------------------------
% 0.18/0.48  % User time                : 0.008 s
% 0.18/0.48  % System time              : 0.009 s
% 0.18/0.48  % Total time               : 0.017 s
% 0.18/0.48  % Maximum resident set size: 4608 pages
% 0.18/0.48  % E exiting
%------------------------------------------------------------------------------