↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP671-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.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:40:43 PM UTC 2026

% Result   : Unsatisfiable 0.26s 0.55s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   4 RR)
%            Number of literals    :   11 (  10 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(goals,negated_conjecture,
    mult(mult(a,b),a) != mult(a,mult(b,a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(c05,axiom,
    mult(X1,unit) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).

cnf(c09,axiom,
    mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(mult(mult(X1,mult(X2,X3)),X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).

cnf(c06,axiom,
    mult(unit,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).

cnf(c_0_4,negated_conjecture,
    mult(mult(a,b),a) != mult(a,mult(b,a)),
    inference(fof_simplification,[status(thm)],[goals]) ).

cnf(c_0_5,axiom,
    mult(X1,unit) = X1,
    c05 ).

cnf(c_0_6,axiom,
    mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(mult(mult(X1,mult(X2,X3)),X1),X2),
    c09 ).

cnf(c_0_7,axiom,
    mult(unit,X1) = X1,
    c06 ).

cnf(c_0_8,negated_conjecture,
    mult(mult(a,b),a) != mult(a,mult(b,a)),
    c_0_4 ).

cnf(c_0_9,plain,
    mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]),c_0_5]),c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP671-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.40  % Computer : n016.cluster.edu
% 0.16/0.40  % Model    : x86_64 x86_64
% 0.16/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40  % Memory   : 8046.5625MB
% 0.16/0.40  % OS       : Linux 6.8.0-71-generic
% 0.16/0.40  % CPULimit : 300
% 0.16/0.40  % WCLimit  : 300
% 0.16/0.40  % DateTime : Sun Sep 20 20:36:36 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.50  Running first-order theorem proving
% 0.20/0.50  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.26/0.55  % Version: 3.5.1
% 0.26/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55  % Starting sh5l with 300s (1) cores
% 0.26/0.55  % sh5l with pid 761444 completed with status 0
% 0.26/0.55  % Result found by sh5l
% 0.26/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55  % Starting sh5l with 300s (1) cores
% 0.26/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.55  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55  % SubtermCWHack with pid 761450 completed with status 0
% 0.26/0.55  % Result found by SubtermCWHack
% 0.26/0.55  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.55  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.55  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.55  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.55  % Starting sh5l with 300s (1) cores
% 0.26/0.55  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.55  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.55  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.26/0.55  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.55  % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.55  % Preprocessing time       : 0.002 s
% 0.26/0.55  
% 0.26/0.55  % Proof found!
% 0.26/0.55  % SZS status Unsatisfiable
% 0.26/0.55  % SZS output start CNFRefutation
% See solution above
% 0.26/0.55  % Parsed axioms                        : 10
% 0.26/0.55  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.55  % Initial clauses                      : 10
% 0.26/0.55  % Removed in clause preprocessing      : 0
% 0.26/0.55  % Initial clauses in saturation        : 10
% 0.26/0.55  % Processed clauses                    : 70
% 0.26/0.55  % ...of these trivial                  : 21
% 0.26/0.55  % ...subsumed                          : 0
% 0.26/0.55  % ...remaining for further processing  : 49
% 0.26/0.55  % Other redundant clauses eliminated   : 0
% 0.26/0.55  % Clauses deleted for lack of memory   : 0
% 0.26/0.55  % Backward-subsumed                    : 0
% 0.26/0.55  % Backward-rewritten                   : 16
% 0.26/0.55  % Generated clauses                    : 454
% 0.26/0.55  % ...of the previous two non-redundant : 153
% 0.26/0.55  % ...aggressively subsumed             : 0
% 0.26/0.55  % Contextual simplify-reflections      : 0
% 0.26/0.55  % Paramodulations                      : 454
% 0.26/0.55  % Factorizations                       : 0
% 0.26/0.55  % NegExts                              : 0
% 0.26/0.55  % Equation resolutions                 : 0
% 0.26/0.55  % Disequality decompositions           : 0
% 0.26/0.55  % Total rewrite steps                  : 657
% 0.26/0.55  % ...of those cached                   : 476
% 0.26/0.55  % Propositional unsat checks           : 0
% 0.26/0.55  %    Propositional check models        : 0
% 0.26/0.55  %    Propositional check unsatisfiable : 0
% 0.26/0.55  %    Propositional clauses             : 0
% 0.26/0.55  %    Propositional clauses after purity: 0
% 0.26/0.55  %    Propositional unsat core size     : 0
% 0.26/0.55  %    Propositional preprocessing time  : 0.000
% 0.26/0.55  %    Propositional encoding time       : 0.000
% 0.26/0.55  %    Propositional solver time         : 0.000
% 0.26/0.55  %    Success case prop preproc time    : 0.000
% 0.26/0.55  %    Success case prop encoding time   : 0.000
% 0.26/0.55  %    Success case prop solver time     : 0.000
% 0.26/0.55  % Current number of processed clauses  : 33
% 0.26/0.55  %    Positive orientable unit clauses  : 33
% 0.26/0.55  %    Positive unorientable unit clauses: 0
% 0.26/0.55  %    Negative unit clauses             : 0
% 0.26/0.55  %    Non-unit-clauses                  : 0
% 0.26/0.55  % Current number of unprocessed clauses: 69
% 0.26/0.55  % ...number of literals in the above   : 69
% 0.26/0.55  % Current number of archived formulas  : 0
% 0.26/0.55  % Current number of archived clauses   : 16
% 0.26/0.55  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.55  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.55  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.55  % Unit Clause-clause subsumption calls : 0
% 0.26/0.55  % Rewrite failures with RHS unbound    : 0
% 0.26/0.55  % BW rewrite match attempts            : 24
% 0.26/0.55  % BW rewrite match successes           : 16
% 0.26/0.55  % Condensation attempts                : 0
% 0.26/0.55  % Condensation successes               : 0
% 0.26/0.55  % Termbank termtop insertions          : 2795
% 0.26/0.55  % Search garbage collected termcells   : 2
% 0.26/0.55  
% 0.26/0.55  % -------------------------------------------------
% 0.26/0.55  % User time                : 0.011 s
% 0.26/0.55  % System time              : 0.002 s
% 0.26/0.55  % Total time               : 0.013 s
% 0.26/0.55  % Maximum resident set size: 3636 pages
% 0.26/0.55  
% 0.26/0.55  % -------------------------------------------------
% 0.26/0.55  % User time                : 0.013 s
% 0.26/0.55  % System time              : 0.010 s
% 0.26/0.55  % Total time               : 0.023 s
% 0.26/0.55  % Maximum resident set size: 4864 pages
% 0.26/0.55  % E exiting
%------------------------------------------------------------------------------