↑ 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  : FLD013-2 : 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 : n010.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:07 PM UTC 2026

% Result   : Unsatisfiable 0.27s 0.65s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   38 (  21 unt;   0 nHn;  38 RR)
%            Number of literals    :   66 (   0 equ;  31 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn)

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

cnf(a_equals_b_6,negated_conjecture,
    equalish(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_6) ).

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(symmetry_of_equality,axiom,
    ( ~ equalish(X2,X1)
    | equalish(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

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

cnf(add_equals_u_8,negated_conjecture,
    equalish(add(a,c),u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_8) ).

cnf(c_equals_d_7,negated_conjecture,
    equalish(c,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_7) ).

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

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

cnf(add_not_equal_to_u_9,negated_conjecture,
    ~ equalish(add(d,b),u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_not_equal_to_u_9) ).

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

cnf(c_0_11,plain,
    ( ~ equalish(X1,X3)
    | ~ defined(X2)
    | equalish(add(X1,X2),add(X3,X2)) ),
    c_0_10 ).

cnf(c_0_12,negated_conjecture,
    equalish(a,b),
    a_equals_b_6 ).

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

cnf(c_0_14,plain,
    ( ~ equalish(X2,X1)
    | equalish(X1,X2) ),
    inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ defined(X1)
    | equalish(add(a,X1),add(b,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    defined(c),
    c_is_defined ).

cnf(c_0_17,plain,
    ( ~ equalish(X3,X2)
    | ~ equalish(X1,X3)
    | equalish(X1,X2) ),
    c_0_13 ).

cnf(c_0_18,negated_conjecture,
    equalish(add(a,c),u),
    add_equals_u_8 ).

cnf(c_0_19,plain,
    ( ~ equalish(X2,X1)
    | equalish(X1,X2) ),
    c_0_14 ).

cnf(c_0_20,hypothesis,
    equalish(add(a,c),add(b,c)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    equalish(c,d),
    c_equals_d_7 ).

cnf(c_0_22,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | equalish(add(X1,X2),add(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[commutativity_addition]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ equalish(X1,add(a,c))
    | equalish(X1,u) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,hypothesis,
    equalish(add(b,c),add(a,c)),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    ( ~ defined(X1)
    | equalish(add(c,X1),add(d,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_21]) ).

cnf(c_0_26,hypothesis,
    defined(b),
    b_is_defined ).

cnf(c_0_27,plain,
    ( ~ defined(X2)
    | ~ defined(X1)
    | equalish(add(X1,X2),add(X2,X1)) ),
    c_0_22 ).

cnf(c_0_28,negated_conjecture,
    equalish(add(b,c),u),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,hypothesis,
    equalish(add(c,b),add(d,b)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( ~ equalish(X1,add(X3,X2))
    | ~ defined(X3)
    | ~ defined(X2)
    | equalish(X1,add(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    equalish(u,add(b,c)),
    inference(spm,[status(thm)],[c_0_19,c_0_28]) ).

cnf(c_0_32,hypothesis,
    ( ~ equalish(X1,add(c,b))
    | equalish(X1,add(d,b)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    equalish(u,add(c,b)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16]),c_0_26])]) ).

cnf(c_0_34,negated_conjecture,
    ~ equalish(add(d,b),u),
    inference(fof_simplification,[status(thm)],[add_not_equal_to_u_9]) ).

cnf(c_0_35,hypothesis,
    equalish(u,add(d,b)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ equalish(add(d,b),u),
    c_0_34 ).

cnf(c_0_37,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_35]),c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : FLD013-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45  % Computer : n010.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Mon Sep 21 15:37:55 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.51  Running first-order theorem proving
% 0.18/0.51  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.27/0.65  % Version: 3.5.1
% 0.27/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.65  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.65  % Starting sh5l with 300s (1) cores
% 0.27/0.65  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1199116 completed with status 0
% 0.27/0.65  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65  % No SInE strategy applied
% 0.27/0.65  % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.27/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.65  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.27/0.65  % Starting new_bool_3 with 269s (1) cores
% 0.27/0.65  % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.27/0.65  % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 1199126 completed with status 0
% 0.27/0.65  % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 0.27/0.65  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.65  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65  % No SInE strategy applied
% 0.27/0.65  % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.27/0.65  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.65  % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.27/0.65  % Starting new_bool_3 with 269s (1) cores
% 0.27/0.65  % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.27/0.65  % Preprocessing time       : 0.002 s
% 0.27/0.65  % Presaturation interreduction done
% 0.27/0.65  
% 0.27/0.65  % Proof found!
% 0.27/0.65  % SZS status Unsatisfiable
% 0.27/0.65  % SZS output start CNFRefutation
% See solution above
% 0.27/0.65  % Parsed axioms                        : 36
% 0.27/0.65  % Removed by relevancy pruning/SinE    : 0
% 0.27/0.65  % Initial clauses                      : 36
% 0.27/0.65  % Removed in clause preprocessing      : 0
% 0.27/0.65  % Initial clauses in saturation        : 36
% 0.27/0.65  % Processed clauses                    : 517
% 0.27/0.65  % ...of these trivial                  : 29
% 0.27/0.65  % ...subsumed                          : 52
% 0.27/0.65  % ...remaining for further processing  : 436
% 0.27/0.65  % Other redundant clauses eliminated   : 0
% 0.27/0.65  % Clauses deleted for lack of memory   : 0
% 0.27/0.65  % Backward-subsumed                    : 0
% 0.27/0.65  % Backward-rewritten                   : 0
% 0.27/0.65  % Generated clauses                    : 2554
% 0.27/0.65  % ...of the previous two non-redundant : 2030
% 0.27/0.65  % ...aggressively subsumed             : 0
% 0.27/0.65  % Contextual simplify-reflections      : 0
% 0.27/0.65  % Paramodulations                      : 2554
% 0.27/0.65  % Factorizations                       : 0
% 0.27/0.65  % NegExts                              : 0
% 0.27/0.65  % Equation resolutions                 : 0
% 0.27/0.65  % Disequality decompositions           : 0
% 0.27/0.65  % Total rewrite steps                  : 792
% 0.27/0.65  % ...of those cached                   : 594
% 0.27/0.65  % Propositional unsat checks           : 0
% 0.27/0.65  %    Propositional check models        : 0
% 0.27/0.65  %    Propositional check unsatisfiable : 0
% 0.27/0.65  %    Propositional clauses             : 0
% 0.27/0.65  %    Propositional clauses after purity: 0
% 0.27/0.65  %    Propositional unsat core size     : 0
% 0.27/0.65  %    Propositional preprocessing time  : 0.000
% 0.27/0.65  %    Propositional encoding time       : 0.000
% 0.27/0.65  %    Propositional solver time         : 0.000
% 0.27/0.65  %    Success case prop preproc time    : 0.000
% 0.27/0.65  %    Success case prop encoding time   : 0.000
% 0.27/0.65  %    Success case prop solver time     : 0.000
% 0.27/0.65  % Current number of processed clauses  : 400
% 0.27/0.65  %    Positive orientable unit clauses  : 217
% 0.27/0.65  %    Positive unorientable unit clauses: 0
% 0.27/0.65  %    Negative unit clauses             : 2
% 0.27/0.65  %    Non-unit-clauses                  : 181
% 0.27/0.65  % Current number of unprocessed clauses: 1585
% 0.27/0.65  % ...number of literals in the above   : 4163
% 0.27/0.65  % Current number of archived formulas  : 0
% 0.27/0.65  % Current number of archived clauses   : 36
% 0.27/0.65  % Clause-clause subsumption calls (NU) : 2443
% 0.27/0.65  % Rec. Clause-clause subsumption calls : 2035
% 0.27/0.65  % Non-unit clause-clause subsumptions  : 52
% 0.27/0.65  % Unit Clause-clause subsumption calls : 371
% 0.27/0.65  % Rewrite failures with RHS unbound    : 0
% 0.27/0.65  % BW rewrite match attempts            : 0
% 0.27/0.65  % BW rewrite match successes           : 0
% 0.27/0.65  % Condensation attempts                : 0
% 0.27/0.65  % Condensation successes               : 0
% 0.27/0.65  % Termbank termtop insertions          : 32547
% 0.27/0.65  % Search garbage collected termcells   : 71
% 0.27/0.65  
% 0.27/0.65  % -------------------------------------------------
% 0.27/0.65  % User time                : 0.076 s
% 0.27/0.65  % System time              : 0.010 s
% 0.27/0.65  % Total time               : 0.087 s
% 0.27/0.65  % Maximum resident set size: 3660 pages
% 0.27/0.65  
% 0.27/0.65  % -------------------------------------------------
% 0.27/0.65  % User time                : 0.336 s
% 0.27/0.65  % System time              : 0.037 s
% 0.27/0.65  % Total time               : 0.372 s
% 0.27/0.65  % Maximum resident set size: 4864 pages
% 0.27/0.65  % E exiting
%------------------------------------------------------------------------------