↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n001.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:44:42 PM UTC 2026

% Result   : Unsatisfiable 0.17s 0.53s
% Output   : CNFRefutation 0.17s
% 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/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(c05,axiom,
    mult(X1,unit) = X1,
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',c09) ).

cnf(c06,axiom,
    mult(unit,X1) = X1,
    file('/export/starexec/sandbox2/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.03  % Problem  : GRP671-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n001.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 20 20:37:27 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.47  Running first-order theorem proving
% 0.17/0.48  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.17/0.53  % Version: 3.5.1
% 0.17/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.17/0.53  % Starting new_bool_1 with 300s (1) cores
% 0.17/0.53  % Starting sh5l with 300s (1) cores
% 0.17/0.53  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1368164 completed with status 0
% 0.17/0.53  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.53  % No SInE strategy applied
% 0.17/0.53  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.53  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.53  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.17/0.53  % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.53  % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.17/0.53  % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1368173 completed with status 0
% 0.17/0.53  % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.17/0.53  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.53  % No SInE strategy applied
% 0.17/0.53  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.53  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.53  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.53  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.17/0.53  % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.53  % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.17/0.53  % Preprocessing time       : 0.002 s
% 0.17/0.53  
% 0.17/0.53  % Proof found!
% 0.17/0.53  % SZS status Unsatisfiable
% 0.17/0.53  % SZS output start CNFRefutation
% See solution above
% 0.17/0.53  % Parsed axioms                        : 10
% 0.17/0.53  % Removed by relevancy pruning/SinE    : 0
% 0.17/0.53  % Initial clauses                      : 10
% 0.17/0.53  % Removed in clause preprocessing      : 0
% 0.17/0.53  % Initial clauses in saturation        : 10
% 0.17/0.53  % Processed clauses                    : 23
% 0.17/0.53  % ...of these trivial                  : 2
% 0.17/0.53  % ...subsumed                          : 0
% 0.17/0.53  % ...remaining for further processing  : 21
% 0.17/0.53  % Other redundant clauses eliminated   : 0
% 0.17/0.53  % Clauses deleted for lack of memory   : 0
% 0.17/0.53  % Backward-subsumed                    : 0
% 0.17/0.53  % Backward-rewritten                   : 7
% 0.17/0.53  % Generated clauses                    : 84
% 0.17/0.53  % ...of the previous two non-redundant : 59
% 0.17/0.53  % ...aggressively subsumed             : 0
% 0.17/0.53  % Contextual simplify-reflections      : 0
% 0.17/0.53  % Paramodulations                      : 84
% 0.17/0.53  % Factorizations                       : 0
% 0.17/0.53  % NegExts                              : 0
% 0.17/0.53  % Equation resolutions                 : 0
% 0.17/0.53  % Disequality decompositions           : 0
% 0.17/0.53  % Total rewrite steps                  : 53
% 0.17/0.53  % ...of those cached                   : 26
% 0.17/0.53  % Propositional unsat checks           : 0
% 0.17/0.53  %    Propositional check models        : 0
% 0.17/0.53  %    Propositional check unsatisfiable : 0
% 0.17/0.53  %    Propositional clauses             : 0
% 0.17/0.53  %    Propositional clauses after purity: 0
% 0.17/0.53  %    Propositional unsat core size     : 0
% 0.17/0.53  %    Propositional preprocessing time  : 0.000
% 0.17/0.53  %    Propositional encoding time       : 0.000
% 0.17/0.53  %    Propositional solver time         : 0.000
% 0.17/0.53  %    Success case prop preproc time    : 0.000
% 0.17/0.53  %    Success case prop encoding time   : 0.000
% 0.17/0.53  %    Success case prop solver time     : 0.000
% 0.17/0.53  % Current number of processed clauses  : 14
% 0.17/0.53  %    Positive orientable unit clauses  : 14
% 0.17/0.53  %    Positive unorientable unit clauses: 0
% 0.17/0.53  %    Negative unit clauses             : 0
% 0.17/0.53  %    Non-unit-clauses                  : 0
% 0.17/0.53  % Current number of unprocessed clauses: 27
% 0.17/0.53  % ...number of literals in the above   : 27
% 0.17/0.53  % Current number of archived formulas  : 0
% 0.17/0.53  % Current number of archived clauses   : 7
% 0.17/0.53  % Clause-clause subsumption calls (NU) : 0
% 0.17/0.53  % Rec. Clause-clause subsumption calls : 0
% 0.17/0.53  % Non-unit clause-clause subsumptions  : 0
% 0.17/0.53  % Unit Clause-clause subsumption calls : 0
% 0.17/0.53  % Rewrite failures with RHS unbound    : 0
% 0.17/0.53  % BW rewrite match attempts            : 13
% 0.17/0.53  % BW rewrite match successes           : 6
% 0.17/0.53  % Condensation attempts                : 0
% 0.17/0.53  % Condensation successes               : 0
% 0.17/0.53  % Termbank termtop insertions          : 709
% 0.17/0.53  % Search garbage collected termcells   : 2
% 0.17/0.53  
% 0.17/0.53  % -------------------------------------------------
% 0.17/0.53  % User time                : 0.004 s
% 0.17/0.53  % System time              : 0.005 s
% 0.17/0.53  % Total time               : 0.010 s
% 0.17/0.53  % Maximum resident set size: 3380 pages
% 0.17/0.53  
% 0.17/0.53  % -------------------------------------------------
% 0.17/0.53  % User time                : 0.020 s
% 0.17/0.53  % System time              : 0.019 s
% 0.17/0.53  % Total time               : 0.039 s
% 0.17/0.53  % Maximum resident set size: 4608 pages
% 0.17/0.53  % E exiting
%------------------------------------------------------------------------------