↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n020.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:36 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(product_symmetry,hypothesis,
    ( ~ product(X1,X2,X3)
    | product(X2,X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_symmetry) ).

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/sandbox2/benchmark/theBenchmark.p',distributivity1) ).

cnf(d_plus_a,negated_conjecture,
    product(d,a,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_plus_a) ).

cnf(c_plus_a,negated_conjecture,
    product(c,a,n),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_plus_a) ).

cnf(b_plus_a,negated_conjecture,
    product(b,a,l),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_plus_a) ).

cnf(prove_equation,negated_conjecture,
    ~ sum(l,n,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equation) ).

cnf(b_plus_c,negated_conjecture,
    sum(b,c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_plus_c) ).

cnf(c_0_7,hypothesis,
    ( ~ product(X1,X2,X3)
    | product(X2,X1,X3) ),
    inference(fof_simplification,[status(thm)],[product_symmetry]) ).

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,hypothesis,
    ( ~ product(X1,X2,X3)
    | product(X2,X1,X3) ),
    c_0_7 ).

cnf(c_0_10,negated_conjecture,
    product(d,a,additive_identity),
    d_plus_a ).

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,negated_conjecture,
    product(a,d,additive_identity),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    product(c,a,n),
    c_plus_a ).

cnf(c_0_14,negated_conjecture,
    ( ~ sum(X4,X3,d)
    | ~ product(a,X4,X1)
    | ~ product(a,X3,X2)
    | sum(X1,X2,additive_identity) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    product(a,c,n),
    inference(spm,[status(thm)],[c_0_9,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    product(b,a,l),
    b_plus_a ).

cnf(c_0_17,negated_conjecture,
    ~ sum(l,n,additive_identity),
    inference(fof_simplification,[status(thm)],[prove_equation]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ sum(X2,c,d)
    | ~ product(a,X2,X1)
    | sum(X1,n,additive_identity) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    product(a,b,l),
    inference(spm,[status(thm)],[c_0_9,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    sum(b,c,d),
    b_plus_c ).

cnf(c_0_21,negated_conjecture,
    ~ sum(l,n,additive_identity),
    c_0_17 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : RNG040-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n020.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 04:15:32 UTC 2026
% 0.19/0.45  % CPUTime  : 
% 0.19/0.45  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52  Running first-order theorem proving
% 0.23/0.52  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.93/0.66  % Version: 3.5.1
% 0.93/0.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.93/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.93/0.66  % Starting new_bool_3 with 300s (1) cores
% 0.93/0.66  % Starting new_bool_1 with 300s (1) cores
% 0.93/0.66  % Starting sh5l with 300s (1) cores
% 0.93/0.66  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1978088 completed with status 0
% 0.93/0.66  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.93/0.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.93/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.93/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.66  % No SInE strategy applied
% 0.93/0.66  % Search class: FGUSM-FFMS21-SFFFFFNN
% 0.93/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.66  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.93/0.66  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.93/0.66  % Starting new_bool_3 with 136s (1) cores
% 0.93/0.66  % Starting new_bool_1 with 136s (1) cores
% 0.93/0.66  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1978094 completed with status 0
% 0.93/0.66  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.93/0.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.93/0.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.93/0.66  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.93/0.66  % No SInE strategy applied
% 0.93/0.66  % Search class: FGUSM-FFMS21-SFFFFFNN
% 0.93/0.66  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.93/0.66  % Starting SubtermCWHack with 136s (1) cores
% 0.93/0.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.93/0.66  % Preprocessing time       : 0.002 s
% 0.93/0.66  % Presaturation interreduction done
% 0.93/0.66  
% 0.93/0.66  % Proof found!
% 0.93/0.66  % SZS status Unsatisfiable
% 0.93/0.66  % SZS output start CNFRefutation
% See solution above
% 0.93/0.66  % Parsed axioms                        : 25
% 0.93/0.66  % Removed by relevancy pruning/SinE    : 0
% 0.93/0.66  % Initial clauses                      : 25
% 0.93/0.66  % Removed in clause preprocessing      : 0
% 0.93/0.66  % Initial clauses in saturation        : 25
% 0.93/0.66  % Processed clauses                    : 896
% 0.93/0.66  % ...of these trivial                  : 133
% 0.93/0.66  % ...subsumed                          : 136
% 0.93/0.66  % ...remaining for further processing  : 627
% 0.93/0.66  % Other redundant clauses eliminated   : 0
% 0.93/0.66  % Clauses deleted for lack of memory   : 0
% 0.93/0.66  % Backward-subsumed                    : 2
% 0.93/0.66  % Backward-rewritten                   : 129
% 0.93/0.66  % Generated clauses                    : 2931
% 0.93/0.66  % ...of the previous two non-redundant : 2048
% 0.93/0.66  % ...aggressively subsumed             : 0
% 0.93/0.66  % Contextual simplify-reflections      : 0
% 0.93/0.66  % Paramodulations                      : 2931
% 0.93/0.66  % Factorizations                       : 0
% 0.93/0.66  % NegExts                              : 0
% 0.93/0.66  % Equation resolutions                 : 0
% 0.93/0.66  % Disequality decompositions           : 0
% 0.93/0.66  % Total rewrite steps                  : 1686
% 0.93/0.66  % ...of those cached                   : 1361
% 0.93/0.66  % Propositional unsat checks           : 0
% 0.93/0.66  %    Propositional check models        : 0
% 0.93/0.66  %    Propositional check unsatisfiable : 0
% 0.93/0.66  %    Propositional clauses             : 0
% 0.93/0.66  %    Propositional clauses after purity: 0
% 0.93/0.66  %    Propositional unsat core size     : 0
% 0.93/0.66  %    Propositional preprocessing time  : 0.000
% 0.93/0.66  %    Propositional encoding time       : 0.000
% 0.93/0.66  %    Propositional solver time         : 0.000
% 0.93/0.66  %    Success case prop preproc time    : 0.000
% 0.93/0.66  %    Success case prop encoding time   : 0.000
% 0.93/0.66  %    Success case prop solver time     : 0.000
% 0.93/0.66  % Current number of processed clauses  : 471
% 0.93/0.66  %    Positive orientable unit clauses  : 92
% 0.93/0.66  %    Positive unorientable unit clauses: 2
% 0.93/0.66  %    Negative unit clauses             : 1
% 0.93/0.66  %    Non-unit-clauses                  : 376
% 0.93/0.66  % Current number of unprocessed clauses: 1048
% 0.93/0.66  % ...number of literals in the above   : 2891
% 0.93/0.66  % Current number of archived formulas  : 0
% 0.93/0.66  % Current number of archived clauses   : 156
% 0.93/0.66  % Clause-clause subsumption calls (NU) : 17460
% 0.93/0.66  % Rec. Clause-clause subsumption calls : 15170
% 0.93/0.66  % Non-unit clause-clause subsumptions  : 136
% 0.93/0.66  % Unit Clause-clause subsumption calls : 934
% 0.93/0.66  % Rewrite failures with RHS unbound    : 0
% 0.93/0.66  % BW rewrite match attempts            : 338
% 0.93/0.66  % BW rewrite match successes           : 207
% 0.93/0.66  % Condensation attempts                : 0
% 0.93/0.66  % Condensation successes               : 0
% 0.93/0.66  % Termbank termtop insertions          : 34931
% 0.93/0.66  % Search garbage collected termcells   : 50
% 0.93/0.66  
% 0.93/0.66  % -------------------------------------------------
% 0.93/0.66  % User time                : 0.110 s
% 0.93/0.66  % System time              : 0.007 s
% 0.93/0.66  % Total time               : 0.118 s
% 0.93/0.66  % Maximum resident set size: 3392 pages
% 0.93/0.66  
% 0.93/0.66  % -------------------------------------------------
% 0.93/0.66  % User time                : 0.506 s
% 0.93/0.66  % System time              : 0.035 s
% 0.93/0.66  % Total time               : 0.541 s
% 0.93/0.66  % Maximum resident set size: 4864 pages
% 0.93/0.66  % E exiting
%------------------------------------------------------------------------------