↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n008.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:38:57 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

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

cnf(condition,hypothesis,
    multiply(X1,multiply(X2,X2)) = multiply(X2,multiply(X2,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).

cnf(c_0_3,negated_conjecture,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    inference(fof_simplification,[status(thm)],[prove_this]) ).

cnf(c_0_4,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity_of_multiply ).

cnf(c_0_5,hypothesis,
    multiply(X1,multiply(X2,X2)) = multiply(X2,multiply(X2,X1)),
    condition ).

cnf(c_0_6,negated_conjecture,
    multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) != multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b))))))),
    c_0_3 ).

cnf(c_0_7,hypothesis,
    multiply(X1,multiply(X2,multiply(X3,multiply(X2,X3)))) = multiply(X2,multiply(X3,multiply(X2,multiply(X3,X1)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_4]),c_0_4]) ).

cnf(c_0_8,hypothesis,
    multiply(X1,multiply(X2,multiply(X2,X3))) = multiply(X2,multiply(X2,multiply(X1,X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_4]),c_0_4]),c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP195-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n008.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 20:06:24 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.46  Running first-order theorem proving
% 0.14/0.46  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.14/0.50  % Version: 3.5.1
% 0.14/0.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.50  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50  % Starting sh5l with 300s (1) cores
% 0.14/0.50  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3491841 completed with status 0
% 0.14/0.50  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50  % No SInE strategy applied
% 0.14/0.50  % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.14/0.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.50  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.50  % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.50  % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.50  % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 3491848 completed with status 0
% 0.14/0.50  % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.14/0.50  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.50  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50  % No SInE strategy applied
% 0.14/0.50  % Search class: FUUPS-FFSF22-DFFFFFNN
% 0.14/0.50  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.50  % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.50  % Preprocessing time       : 0.002 s
% 0.14/0.50  % Presaturation interreduction done
% 0.14/0.50  
% 0.14/0.50  % Proof found!
% 0.14/0.50  % SZS status Unsatisfiable
% 0.14/0.50  % SZS output start CNFRefutation
% See solution above
% 0.14/0.50  % Parsed axioms                        : 3
% 0.14/0.50  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.50  % Initial clauses                      : 3
% 0.14/0.50  % Removed in clause preprocessing      : 0
% 0.14/0.50  % Initial clauses in saturation        : 3
% 0.14/0.50  % Processed clauses                    : 10
% 0.14/0.50  % ...of these trivial                  : 0
% 0.14/0.50  % ...subsumed                          : 0
% 0.14/0.50  % ...remaining for further processing  : 9
% 0.14/0.50  % Other redundant clauses eliminated   : 0
% 0.14/0.50  % Clauses deleted for lack of memory   : 0
% 0.14/0.50  % Backward-subsumed                    : 0
% 0.14/0.50  % Backward-rewritten                   : 0
% 0.14/0.50  % Generated clauses                    : 151
% 0.14/0.50  % ...of the previous two non-redundant : 146
% 0.14/0.50  % ...aggressively subsumed             : 0
% 0.14/0.50  % Contextual simplify-reflections      : 0
% 0.14/0.50  % Paramodulations                      : 151
% 0.14/0.50  % Factorizations                       : 0
% 0.14/0.50  % NegExts                              : 0
% 0.14/0.50  % Equation resolutions                 : 0
% 0.14/0.50  % Disequality decompositions           : 0
% 0.14/0.50  % Total rewrite steps                  : 276
% 0.14/0.50  % ...of those cached                   : 110
% 0.14/0.50  % Propositional unsat checks           : 0
% 0.14/0.50  %    Propositional check models        : 0
% 0.14/0.50  %    Propositional check unsatisfiable : 0
% 0.14/0.50  %    Propositional clauses             : 0
% 0.14/0.50  %    Propositional clauses after purity: 0
% 0.14/0.50  %    Propositional unsat core size     : 0
% 0.14/0.50  %    Propositional preprocessing time  : 0.000
% 0.14/0.50  %    Propositional encoding time       : 0.000
% 0.14/0.50  %    Propositional solver time         : 0.000
% 0.14/0.50  %    Success case prop preproc time    : 0.000
% 0.14/0.50  %    Success case prop encoding time   : 0.000
% 0.14/0.50  %    Success case prop solver time     : 0.000
% 0.14/0.50  % Current number of processed clauses  : 6
% 0.14/0.50  %    Positive orientable unit clauses  : 1
% 0.14/0.50  %    Positive unorientable unit clauses: 4
% 0.14/0.50  %    Negative unit clauses             : 1
% 0.14/0.50  %    Non-unit-clauses                  : 0
% 0.14/0.50  % Current number of unprocessed clauses: 142
% 0.14/0.50  % ...number of literals in the above   : 142
% 0.14/0.50  % Current number of archived formulas  : 0
% 0.14/0.50  % Current number of archived clauses   : 3
% 0.14/0.50  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.50  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.50  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.50  % Unit Clause-clause subsumption calls : 3
% 0.14/0.50  % Rewrite failures with RHS unbound    : 0
% 0.14/0.50  % BW rewrite match attempts            : 40
% 0.14/0.50  % BW rewrite match successes           : 10
% 0.14/0.50  % Condensation attempts                : 0
% 0.14/0.50  % Condensation successes               : 0
% 0.14/0.50  % Termbank termtop insertions          : 2371
% 0.14/0.50  % Search garbage collected termcells   : 2
% 0.14/0.50  
% 0.14/0.50  % -------------------------------------------------
% 0.14/0.50  % User time                : 0.008 s
% 0.14/0.50  % System time              : 0.004 s
% 0.14/0.50  % Total time               : 0.012 s
% 0.14/0.50  % Maximum resident set size: 3636 pages
% 0.14/0.50  
% 0.14/0.50  % -------------------------------------------------
% 0.14/0.50  % User time                : 0.033 s
% 0.14/0.50  % System time              : 0.017 s
% 0.14/0.50  % Total time               : 0.050 s
% 0.14/0.50  % Maximum resident set size: 4864 pages
% 0.14/0.50  % E exiting
%------------------------------------------------------------------------------