↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n026.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 02:05:35 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(commutativity_of_addition,axiom,
    ( ~ sum(X1,X2,X3)
    | sum(X2,X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_addition) ).

cnf(distributivity1,axiom,
    ( ~ product(X1,X6,X7)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X4,X5)
    | ~ product(X1,X2,X3)
    | sum(X3,X5,X7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity1) ).

cnf(additive_inverse2,axiom,
    sum(X1,additive_inverse(X1),additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse2) ).

cnf(a_times_b,hypothesis,
    product(a,b,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b) ).

cnf(multiplicative_identity2,axiom,
    product(X1,additive_identity,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_identity2) ).

cnf(prove_sum_is_additive_identity,negated_conjecture,
    ~ sum(c,d,additive_identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sum_is_additive_identity) ).

cnf(a_inverse_times_b,hypothesis,
    product(a,additive_inverse(b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_inverse_times_b) ).

cnf(c_0_7,plain,
    ( ~ sum(X1,X2,X3)
    | sum(X2,X1,X3) ),
    inference(fof_simplification,[status(thm)],[commutativity_of_addition]) ).

cnf(c_0_8,plain,
    ( ~ product(X1,X6,X7)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X4,X5)
    | ~ product(X1,X2,X3)
    | sum(X3,X5,X7) ),
    inference(fof_simplification,[status(thm)],[distributivity1]) ).

cnf(c_0_9,plain,
    ( ~ sum(X1,X2,X3)
    | sum(X2,X1,X3) ),
    c_0_7 ).

cnf(c_0_10,axiom,
    sum(X1,additive_inverse(X1),additive_identity),
    additive_inverse2 ).

cnf(c_0_11,plain,
    ( ~ product(X1,X6,X7)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X4,X5)
    | ~ product(X1,X2,X3)
    | sum(X3,X5,X7) ),
    c_0_8 ).

cnf(c_0_12,plain,
    sum(additive_inverse(X1),X1,additive_identity),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    ( ~ product(X4,X5,X2)
    | ~ product(X4,additive_identity,X3)
    | ~ product(X4,additive_inverse(X5),X1)
    | sum(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,hypothesis,
    product(a,b,d),
    a_times_b ).

cnf(c_0_15,hypothesis,
    ( ~ product(a,additive_identity,X2)
    | ~ product(a,additive_inverse(b),X1)
    | sum(X1,d,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,axiom,
    product(X1,additive_identity,additive_identity),
    multiplicative_identity2 ).

cnf(c_0_17,negated_conjecture,
    ~ sum(c,d,additive_identity),
    inference(fof_simplification,[status(thm)],[prove_sum_is_additive_identity]) ).

cnf(c_0_18,hypothesis,
    ( ~ product(a,additive_inverse(b),X1)
    | sum(X1,d,additive_identity) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,hypothesis,
    product(a,additive_inverse(b),c),
    a_inverse_times_b ).

cnf(c_0_20,negated_conjecture,
    ~ sum(c,d,additive_identity),
    c_0_17 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : RNG037-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n026.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 04:17:36 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42  Running first-order theorem proving
% 0.09/0.42  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
% 17.79/2.79  % Version: 3.5.1
% 17.79/2.79  % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.79/2.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.79/2.79  % Starting new_bool_3 with 300s (1) cores
% 17.79/2.79  % Starting new_bool_1 with 300s (1) cores
% 17.79/2.79  % Starting sh5l with 300s (1) cores
% 17.79/2.79  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1343516 completed with status 0
% 17.79/2.79  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 17.79/2.79  % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.79/2.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.79/2.79  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.79/2.79  % No SInE strategy applied
% 17.79/2.79  % Search class: FHUNM-FFMF21-SFFFFFNN
% 17.79/2.79  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 17.79/2.79  % Starting SubtermCWHack with 136s (1) cores
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 17.79/2.79  % Starting G-E--_107_C09_12_F1_PI_AE_Q4_CS_SP_PS_S064A with 136s (1) cores
% 17.79/2.79  % Starting new_bool_3 with 136s (1) cores
% 17.79/2.79  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 1343523 completed with status 0
% 17.79/2.79  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 17.79/2.79  % Preprocessing class: FSMSSMSSSSSNFFN.
% 17.79/2.79  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.79/2.79  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 17.79/2.79  % No SInE strategy applied
% 17.79/2.79  % Search class: FHUNM-FFMF21-SFFFFFNN
% 17.79/2.79  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 17.79/2.79  % Starting SubtermCWHack with 136s (1) cores
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 17.79/2.79  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 17.79/2.79  % Preprocessing time       : 0.001 s
% 17.79/2.79  % Presaturation interreduction done
% 17.79/2.79  
% 17.79/2.79  % Proof found!
% 17.79/2.79  % SZS status Unsatisfiable
% 17.79/2.79  % SZS output start CNFRefutation
% See solution above
% 17.79/2.79  % Parsed axioms                        : 29
% 17.79/2.79  % Removed by relevancy pruning/SinE    : 0
% 17.79/2.79  % Initial clauses                      : 29
% 17.79/2.79  % Removed in clause preprocessing      : 0
% 17.79/2.79  % Initial clauses in saturation        : 29
% 17.79/2.79  % Processed clauses                    : 9908
% 17.79/2.79  % ...of these trivial                  : 3222
% 17.79/2.79  % ...subsumed                          : 2758
% 17.79/2.79  % ...remaining for further processing  : 3928
% 17.79/2.79  % Other redundant clauses eliminated   : 0
% 17.79/2.79  % Clauses deleted for lack of memory   : 0
% 17.79/2.79  % Backward-subsumed                    : 177
% 17.79/2.79  % Backward-rewritten                   : 279
% 17.79/2.79  % Generated clauses                    : 378278
% 17.79/2.79  % ...of the previous two non-redundant : 307066
% 17.79/2.79  % ...aggressively subsumed             : 0
% 17.79/2.79  % Contextual simplify-reflections      : 0
% 17.79/2.79  % Paramodulations                      : 378278
% 17.79/2.79  % Factorizations                       : 0
% 17.79/2.79  % NegExts                              : 0
% 17.79/2.79  % Equation resolutions                 : 0
% 17.79/2.79  % Disequality decompositions           : 0
% 17.79/2.79  % Total rewrite steps                  : 122946
% 17.79/2.79  % ...of those cached                   : 116493
% 17.79/2.79  % Propositional unsat checks           : 0
% 17.79/2.79  %    Propositional check models        : 0
% 17.79/2.79  %    Propositional check unsatisfiable : 0
% 17.79/2.79  %    Propositional clauses             : 0
% 17.79/2.79  %    Propositional clauses after purity: 0
% 17.79/2.79  %    Propositional unsat core size     : 0
% 17.79/2.79  %    Propositional preprocessing time  : 0.000
% 17.79/2.79  %    Propositional encoding time       : 0.000
% 17.79/2.79  %    Propositional solver time         : 0.000
% 17.79/2.79  %    Success case prop preproc time    : 0.000
% 17.79/2.79  %    Success case prop encoding time   : 0.000
% 17.79/2.79  %    Success case prop solver time     : 0.000
% 17.79/2.79  % Current number of processed clauses  : 3443
% 17.79/2.79  %    Positive orientable unit clauses  : 1717
% 17.79/2.79  %    Positive unorientable unit clauses: 0
% 17.79/2.79  %    Negative unit clauses             : 1
% 17.79/2.79  %    Non-unit-clauses                  : 1725
% 17.79/2.79  % Current number of unprocessed clauses: 295753
% 17.79/2.79  % ...number of literals in the above   : 524390
% 17.79/2.79  % Current number of archived formulas  : 0
% 17.79/2.79  % Current number of archived clauses   : 485
% 17.79/2.79  % Clause-clause subsumption calls (NU) : 589911
% 17.79/2.79  % Rec. Clause-clause subsumption calls : 441313
% 17.79/2.79  % Non-unit clause-clause subsumptions  : 2935
% 17.79/2.79  % Unit Clause-clause subsumption calls : 2481
% 17.79/2.79  % Rewrite failures with RHS unbound    : 0
% 17.79/2.79  % BW rewrite match attempts            : 37391
% 17.79/2.79  % BW rewrite match successes           : 279
% 17.79/2.79  % Condensation attempts                : 0
% 17.79/2.79  % Condensation successes               : 0
% 17.79/2.79  % Termbank termtop insertions          : 5480534
% 17.79/2.79  % Search garbage collected termcells   : 90
% 17.79/2.79  
% 17.79/2.79  % -------------------------------------------------
% 17.79/2.79  % User time                : 2.164 s
% 17.79/2.79  % System time              : 0.131 s
% 17.79/2.79  % Total time               : 2.295 s
% 17.79/2.79  % Maximum resident set size: 3656 pages
% 17.79/2.79  
% 17.79/2.79  % -------------------------------------------------
% 17.79/2.79  % User time                : 10.566 s
% 17.79/2.79  % System time              : 0.517 s
% 17.79/2.79  % Total time               : 11.083 s
% 17.79/2.79  % Maximum resident set size: 4864 pages
% 17.79/2.79  % E exiting
%------------------------------------------------------------------------------