↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n002.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:59:08 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.50s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   20
% Syntax   : Number of clauses     :   71 (  71 unt;   0 nHn;  67 RR)
%            Number of literals    :   71 (  70 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   24 (  24 usr;  22 con; 0-3 aty)
%            Number of variables   :   10 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(hyp7,hypothesis,
    a_31 = store(a_27,i4,e_30),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp7) ).

cnf(hyp16,hypothesis,
    a_29 = a_31,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp16) ).

cnf(a1,axiom,
    select(store(X1,X2,X3),X2) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).

cnf(a3,axiom,
    store(X1,X2,select(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a3) ).

cnf(hyp15,hypothesis,
    e_30 = select(a_25,i4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp15) ).

cnf(hyp6,hypothesis,
    a_29 = store(a_25,i4,e_28),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp6) ).

cnf(hyp14,hypothesis,
    e_28 = select(a_27,i4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp14) ).

cnf(hyp4,hypothesis,
    a_25 = store(a_21,i3,e_24),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp4) ).

cnf(hyp5,hypothesis,
    a_27 = store(a_23,i3,e_26),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp5) ).

cnf(hyp13,hypothesis,
    e_26 = select(a_21,i3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp13) ).

cnf(hyp12,hypothesis,
    e_24 = select(a_23,i3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp12) ).

cnf(hyp2,hypothesis,
    a_21 = store(a_17,i2,e_20),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp2) ).

cnf(hyp3,hypothesis,
    a_23 = store(a_19,i2,e_22),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp3) ).

cnf(hyp10,hypothesis,
    e_20 = select(a_19,i2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp10) ).

cnf(hyp11,hypothesis,
    e_22 = select(a_17,i2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp11) ).

cnf(hyp0,hypothesis,
    a_17 = store(a1,i1,e_16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp0) ).

cnf(hyp1,hypothesis,
    a_19 = store(a2,i1,e_18),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp1) ).

cnf(hyp8,hypothesis,
    e_16 = select(a2,i1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp8) ).

cnf(hyp9,hypothesis,
    e_18 = select(a1,i1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hyp9) ).

cnf(goal,negated_conjecture,
    a1 != a2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(c_0_20,hypothesis,
    a_31 = store(a_27,i4,e_30),
    hyp7 ).

cnf(c_0_21,hypothesis,
    a_29 = a_31,
    hyp16 ).

cnf(c_0_22,axiom,
    select(store(X1,X2,X3),X2) = X3,
    a1 ).

cnf(c_0_23,hypothesis,
    store(a_27,i4,e_30) = a_29,
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,axiom,
    store(X1,X2,select(X1,X2)) = X1,
    a3 ).

cnf(c_0_25,hypothesis,
    e_30 = select(a_25,i4),
    hyp15 ).

cnf(c_0_26,hypothesis,
    a_29 = store(a_25,i4,e_28),
    hyp6 ).

cnf(c_0_27,hypothesis,
    select(a_29,i4) = e_30,
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,hypothesis,
    e_28 = select(a_27,i4),
    hyp14 ).

cnf(c_0_29,hypothesis,
    store(a_25,i4,e_30) = a_25,
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,hypothesis,
    e_30 = e_28,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_27]) ).

cnf(c_0_31,hypothesis,
    store(a_27,i4,e_28) = a_27,
    inference(spm,[status(thm)],[c_0_24,c_0_28]) ).

cnf(c_0_32,hypothesis,
    a_29 = a_25,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_26]) ).

cnf(c_0_33,hypothesis,
    a_25 = store(a_21,i3,e_24),
    hyp4 ).

cnf(c_0_34,hypothesis,
    a_25 = a_27,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_30]),c_0_31]),c_0_32]) ).

cnf(c_0_35,hypothesis,
    a_27 = store(a_23,i3,e_26),
    hyp5 ).

cnf(c_0_36,hypothesis,
    e_26 = select(a_21,i3),
    hyp13 ).

cnf(c_0_37,hypothesis,
    store(a_21,i3,e_24) = a_27,
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,hypothesis,
    select(a_27,i3) = e_26,
    inference(spm,[status(thm)],[c_0_22,c_0_35]) ).

cnf(c_0_39,hypothesis,
    e_24 = select(a_23,i3),
    hyp12 ).

cnf(c_0_40,hypothesis,
    store(a_21,i3,e_26) = a_21,
    inference(spm,[status(thm)],[c_0_24,c_0_36]) ).

cnf(c_0_41,hypothesis,
    e_26 = e_24,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_37]),c_0_38]) ).

cnf(c_0_42,hypothesis,
    a_21 = store(a_17,i2,e_20),
    hyp2 ).

cnf(c_0_43,hypothesis,
    store(a_23,i3,e_24) = a_23,
    inference(spm,[status(thm)],[c_0_24,c_0_39]) ).

cnf(c_0_44,hypothesis,
    a_27 = a_21,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_37]) ).

cnf(c_0_45,hypothesis,
    a_23 = store(a_19,i2,e_22),
    hyp3 ).

cnf(c_0_46,hypothesis,
    select(a_21,i2) = e_20,
    inference(spm,[status(thm)],[c_0_22,c_0_42]) ).

cnf(c_0_47,hypothesis,
    a_21 = a_23,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_41]),c_0_43]),c_0_44]) ).

cnf(c_0_48,hypothesis,
    select(a_23,i2) = e_22,
    inference(spm,[status(thm)],[c_0_22,c_0_45]) ).

cnf(c_0_49,hypothesis,
    e_20 = select(a_19,i2),
    hyp10 ).

cnf(c_0_50,hypothesis,
    e_22 = e_20,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).

cnf(c_0_51,hypothesis,
    store(a_19,i2,e_20) = a_19,
    inference(spm,[status(thm)],[c_0_24,c_0_49]) ).

cnf(c_0_52,hypothesis,
    e_22 = select(a_17,i2),
    hyp11 ).

cnf(c_0_53,hypothesis,
    a_23 = a_19,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_50]),c_0_51]) ).

cnf(c_0_54,hypothesis,
    a_17 = store(a1,i1,e_16),
    hyp0 ).

cnf(c_0_55,hypothesis,
    store(a_17,i2,e_22) = a_17,
    inference(spm,[status(thm)],[c_0_24,c_0_52]) ).

cnf(c_0_56,hypothesis,
    store(a_17,i2,e_20) = a_19,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_47]),c_0_53]) ).

cnf(c_0_57,hypothesis,
    a_19 = store(a2,i1,e_18),
    hyp1 ).

cnf(c_0_58,hypothesis,
    select(a_17,i1) = e_16,
    inference(spm,[status(thm)],[c_0_22,c_0_54]) ).

cnf(c_0_59,hypothesis,
    a_17 = a_19,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_50]),c_0_56]) ).

cnf(c_0_60,hypothesis,
    select(a_19,i1) = e_18,
    inference(spm,[status(thm)],[c_0_22,c_0_57]) ).

cnf(c_0_61,hypothesis,
    e_16 = select(a2,i1),
    hyp8 ).

cnf(c_0_62,hypothesis,
    e_18 = e_16,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).

cnf(c_0_63,hypothesis,
    store(a2,i1,e_16) = a2,
    inference(spm,[status(thm)],[c_0_24,c_0_61]) ).

cnf(c_0_64,hypothesis,
    e_18 = select(a1,i1),
    hyp9 ).

cnf(c_0_65,hypothesis,
    a_19 = a2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_62]),c_0_63]) ).

cnf(c_0_66,negated_conjecture,
    a1 != a2,
    inference(fof_simplification,[status(thm)],[goal]) ).

cnf(c_0_67,hypothesis,
    store(a1,i1,e_18) = a1,
    inference(spm,[status(thm)],[c_0_24,c_0_64]) ).

cnf(c_0_68,hypothesis,
    store(a1,i1,e_16) = a2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_59]),c_0_65]) ).

cnf(c_0_69,negated_conjecture,
    a1 != a2,
    c_0_66 ).

cnf(c_0_70,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_62]),c_0_68]),c_0_69]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV558-1.004 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n002.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 09:10:47 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44  Running first-order theorem proving
% 0.16/0.44  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.16/0.50  % Version: 3.5.1
% 0.16/0.50  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.50  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50  % Starting sh5l with 300s (1) cores
% 0.16/0.50  % new_bool_1 with pid 2944437 completed with status 0
% 0.16/0.50  % Result found by new_bool_1
% 0.16/0.50  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.50  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50  % Search class: FGUPS-FFSM32-SFFFFFNN
% 0.16/0.50  % partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.16/0.50  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.50  % SubtermCWHack with pid 2944442 completed with status 0
% 0.16/0.50  % Result found by SubtermCWHack
% 0.16/0.50  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.50  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.50  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.50  % Search class: FGUPS-FFSM32-SFFFFFNN
% 0.16/0.50  % partial match(1): FGUPF-FFSM32-SFFFFFNN
% 0.16/0.50  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.50  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.50  % Preprocessing time       : 0.002 s
% 0.16/0.50  
% 0.16/0.50  % Proof found!
% 0.16/0.50  % SZS status Unsatisfiable
% 0.16/0.50  % SZS output start CNFRefutation
% See solution above
% 0.16/0.50  % Parsed axioms                        : 23
% 0.16/0.50  % Removed by relevancy pruning/SinE    : 0
% 0.16/0.50  % Initial clauses                      : 23
% 0.16/0.50  % Removed in clause preprocessing      : 0
% 0.16/0.50  % Initial clauses in saturation        : 23
% 0.16/0.50  % Processed clauses                    : 94
% 0.16/0.50  % ...of these trivial                  : 10
% 0.16/0.50  % ...subsumed                          : 0
% 0.16/0.50  % ...remaining for further processing  : 83
% 0.16/0.50  % Other redundant clauses eliminated   : 0
% 0.16/0.50  % Clauses deleted for lack of memory   : 0
% 0.16/0.50  % Backward-subsumed                    : 0
% 0.16/0.50  % Backward-rewritten                   : 55
% 0.16/0.50  % Generated clauses                    : 151
% 0.16/0.50  % ...of the previous two non-redundant : 180
% 0.16/0.50  % ...aggressively subsumed             : 0
% 0.16/0.50  % Contextual simplify-reflections      : 0
% 0.16/0.50  % Paramodulations                      : 151
% 0.16/0.50  % Factorizations                       : 0
% 0.16/0.50  % NegExts                              : 0
% 0.16/0.50  % Equation resolutions                 : 0
% 0.16/0.50  % Disequality decompositions           : 0
% 0.16/0.50  % Total rewrite steps                  : 149
% 0.16/0.50  % ...of those cached                   : 101
% 0.16/0.50  % Propositional unsat checks           : 0
% 0.16/0.50  %    Propositional check models        : 0
% 0.16/0.50  %    Propositional check unsatisfiable : 0
% 0.16/0.50  %    Propositional clauses             : 0
% 0.16/0.50  %    Propositional clauses after purity: 0
% 0.16/0.50  %    Propositional unsat core size     : 0
% 0.16/0.50  %    Propositional preprocessing time  : 0.000
% 0.16/0.50  %    Propositional encoding time       : 0.000
% 0.16/0.50  %    Propositional solver time         : 0.000
% 0.16/0.50  %    Success case prop preproc time    : 0.000
% 0.16/0.50  %    Success case prop encoding time   : 0.000
% 0.16/0.50  %    Success case prop solver time     : 0.000
% 0.16/0.50  % Current number of processed clauses  : 28
% 0.16/0.50  %    Positive orientable unit clauses  : 23
% 0.16/0.50  %    Positive unorientable unit clauses: 0
% 0.16/0.50  %    Negative unit clauses             : 1
% 0.16/0.50  %    Non-unit-clauses                  : 4
% 0.16/0.50  % Current number of unprocessed clauses: 96
% 0.16/0.50  % ...number of literals in the above   : 196
% 0.16/0.50  % Current number of archived formulas  : 0
% 0.16/0.50  % Current number of archived clauses   : 55
% 0.16/0.50  % Clause-clause subsumption calls (NU) : 1
% 0.16/0.50  % Rec. Clause-clause subsumption calls : 1
% 0.16/0.50  % Non-unit clause-clause subsumptions  : 0
% 0.16/0.50  % Unit Clause-clause subsumption calls : 0
% 0.16/0.50  % Rewrite failures with RHS unbound    : 0
% 0.16/0.50  % BW rewrite match attempts            : 27
% 0.16/0.50  % BW rewrite match successes           : 11
% 0.16/0.50  % Condensation attempts                : 0
% 0.16/0.50  % Condensation successes               : 0
% 0.16/0.50  % Termbank termtop insertions          : 1481
% 0.16/0.50  % Search garbage collected termcells   : 2
% 0.16/0.50  
% 0.16/0.50  % -------------------------------------------------
% 0.16/0.50  % User time                : 0.009 s
% 0.16/0.50  % System time              : 0.003 s
% 0.16/0.50  % Total time               : 0.012 s
% 0.16/0.50  % Maximum resident set size: 3644 pages
% 0.16/0.50  
% 0.16/0.50  % -------------------------------------------------
% 0.16/0.50  % User time                : 0.013 s
% 0.16/0.50  % System time              : 0.008 s
% 0.16/0.50  % Total time               : 0.020 s
% 0.16/0.50  % Maximum resident set size: 4864 pages
% 0.16/0.50  % E exiting
%------------------------------------------------------------------------------