↑ 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  : FLD034-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n019.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:23:14 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   8 unt;   0 nHn;  19 RR)
%            Number of literals    :   38 (   0 equ;  22 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
    ( ~ equalish(X3,X2)
    | ~ equalish(X1,X3)
    | equalish(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

cnf(existence_of_identity_multiplication,axiom,
    ( ~ defined(X1)
    | equalish(multiply(multiplicative_identity,X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).

cnf(compatibility_of_equality_and_multiplication,axiom,
    ( ~ equalish(X1,X3)
    | ~ defined(X2)
    | equalish(multiply(X1,X2),multiply(X3,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).

cnf(multiply_not_equal_to_a_4,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_a_4) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).

cnf(m_equals_multiplicative_identity_3,negated_conjecture,
    equalish(m,multiplicative_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_equals_multiplicative_identity_3) ).

cnf(c_0_6,plain,
    ( ~ equalish(X3,X2)
    | ~ equalish(X1,X3)
    | equalish(X1,X2) ),
    inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).

cnf(c_0_7,plain,
    ( ~ defined(X1)
    | equalish(multiply(multiplicative_identity,X1),X1) ),
    inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).

cnf(c_0_8,plain,
    ( ~ equalish(X3,X2)
    | ~ equalish(X1,X3)
    | equalish(X1,X2) ),
    c_0_6 ).

cnf(c_0_9,plain,
    ( ~ defined(X1)
    | equalish(multiply(multiplicative_identity,X1),X1) ),
    c_0_7 ).

cnf(c_0_10,plain,
    ( ~ equalish(X1,X3)
    | ~ defined(X2)
    | equalish(multiply(X1,X2),multiply(X3,X2)) ),
    inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_multiplication]) ).

cnf(c_0_11,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    inference(fof_simplification,[status(thm)],[multiply_not_equal_to_a_4]) ).

cnf(c_0_12,plain,
    ( ~ equalish(X1,multiply(multiplicative_identity,X2))
    | ~ defined(X2)
    | equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    ( ~ equalish(X1,X3)
    | ~ defined(X2)
    | equalish(multiply(X1,X2),multiply(X3,X2)) ),
    c_0_10 ).

cnf(c_0_14,negated_conjecture,
    ~ equalish(multiply(m,a),a),
    c_0_11 ).

cnf(c_0_15,plain,
    ( ~ equalish(X1,multiplicative_identity)
    | ~ defined(X2)
    | equalish(multiply(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_17,negated_conjecture,
    equalish(m,multiplicative_identity),
    m_equals_multiplicative_identity_3 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : FLD034-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 15:39:37 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.43  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.19/0.49  % Version: 3.5.1
% 0.19/0.49  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  % Starting sh5l with 300s (1) cores
% 0.19/0.49  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2927502 completed with status 0
% 0.19/0.49  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.49  % No SInE strategy applied
% 0.19/0.49  % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.49  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.19/0.49  % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.49  % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.49  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2927507 completed with status 0
% 0.19/0.49  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.49  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.49  % No SInE strategy applied
% 0.19/0.49  % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.49  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.49  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.49  % Preprocessing time       : 0.002 s
% 0.19/0.49  % Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  % Proof found!
% 0.19/0.49  % SZS status Unsatisfiable
% 0.19/0.49  % SZS output start CNFRefutation
% See solution above
% 0.19/0.49  % Parsed axioms                        : 31
% 0.19/0.49  % Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  % Initial clauses                      : 31
% 0.19/0.49  % Removed in clause preprocessing      : 0
% 0.19/0.49  % Initial clauses in saturation        : 31
% 0.19/0.49  % Processed clauses                    : 622
% 0.19/0.49  % ...of these trivial                  : 9
% 0.19/0.49  % ...subsumed                          : 288
% 0.19/0.49  % ...remaining for further processing  : 325
% 0.19/0.49  % Other redundant clauses eliminated   : 0
% 0.19/0.49  % Clauses deleted for lack of memory   : 0
% 0.19/0.49  % Backward-subsumed                    : 0
% 0.19/0.49  % Backward-rewritten                   : 3
% 0.19/0.49  % Generated clauses                    : 2393
% 0.19/0.49  % ...of the previous two non-redundant : 1899
% 0.19/0.49  % ...aggressively subsumed             : 0
% 0.19/0.49  % Contextual simplify-reflections      : 0
% 0.19/0.49  % Paramodulations                      : 2393
% 0.19/0.49  % Factorizations                       : 0
% 0.19/0.49  % NegExts                              : 0
% 0.19/0.49  % Equation resolutions                 : 0
% 0.19/0.49  % Disequality decompositions           : 0
% 0.19/0.49  % Total rewrite steps                  : 1244
% 0.19/0.49  % ...of those cached                   : 1196
% 0.19/0.49  % Propositional unsat checks           : 0
% 0.19/0.49  %    Propositional check models        : 0
% 0.19/0.49  %    Propositional check unsatisfiable : 0
% 0.19/0.49  %    Propositional clauses             : 0
% 0.19/0.49  %    Propositional clauses after purity: 0
% 0.19/0.49  %    Propositional unsat core size     : 0
% 0.19/0.49  %    Propositional preprocessing time  : 0.000
% 0.19/0.49  %    Propositional encoding time       : 0.000
% 0.19/0.49  %    Propositional solver time         : 0.000
% 0.19/0.49  %    Success case prop preproc time    : 0.000
% 0.19/0.49  %    Success case prop encoding time   : 0.000
% 0.19/0.49  %    Success case prop solver time     : 0.000
% 0.19/0.49  % Current number of processed clauses  : 291
% 0.19/0.49  %    Positive orientable unit clauses  : 58
% 0.19/0.49  %    Positive unorientable unit clauses: 0
% 0.19/0.49  %    Negative unit clauses             : 2
% 0.19/0.49  %    Non-unit-clauses                  : 231
% 0.19/0.49  % Current number of unprocessed clauses: 1294
% 0.19/0.49  % ...number of literals in the above   : 4045
% 0.19/0.49  % Current number of archived formulas  : 0
% 0.19/0.49  % Current number of archived clauses   : 34
% 0.19/0.49  % Clause-clause subsumption calls (NU) : 9034
% 0.19/0.49  % Rec. Clause-clause subsumption calls : 8356
% 0.19/0.49  % Non-unit clause-clause subsumptions  : 287
% 0.19/0.49  % Unit Clause-clause subsumption calls : 182
% 0.19/0.49  % Rewrite failures with RHS unbound    : 0
% 0.19/0.49  % BW rewrite match attempts            : 2
% 0.19/0.49  % BW rewrite match successes           : 2
% 0.19/0.49  % Condensation attempts                : 0
% 0.19/0.49  % Condensation successes               : 0
% 0.19/0.49  % Termbank termtop insertions          : 29280
% 0.19/0.49  % Search garbage collected termcells   : 71
% 0.19/0.49  
% 0.19/0.49  % -------------------------------------------------
% 0.19/0.49  % User time                : 0.042 s
% 0.19/0.49  % System time              : 0.006 s
% 0.19/0.49  % Total time               : 0.049 s
% 0.19/0.49  % Maximum resident set size: 3660 pages
% 0.19/0.49  
% 0.19/0.49  % -------------------------------------------------
% 0.19/0.49  % User time                : 0.192 s
% 0.19/0.49  % System time              : 0.026 s
% 0.19/0.49  % Total time               : 0.218 s
% 0.19/0.49  % Maximum resident set size: 4608 pages
% 0.19/0.49  % E exiting
%------------------------------------------------------------------------------