↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWX204-1 : TPTP v9.3.1. Released v9.3.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 03:14:15 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    eq2(mul_idem(X1),bfalse) != btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(axiom_004,axiom,
    mul_idem(X1) = eq(x22(X1,X1),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).

cnf(axiom_003,axiom,
    x22(s(X1),X2) = x2(X2,x22(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).

cnf(axiom_001,axiom,
    x2(s(X1),X2) = s(x2(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).

cnf(axiom_007,axiom,
    eq(s(X1),s(X2)) = eq(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).

cnf(axiom_002,axiom,
    x22(z,X1) = z,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).

cnf(axiom,axiom,
    x2(z,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom) ).

cnf(axiom_009,axiom,
    eq(s(X1),z) = bfalse,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).

cnf(axiom_011,axiom,
    eq2(X1,X1) = btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).

cnf(c_0_9,negated_conjecture,
    eq2(mul_idem(X1),bfalse) != btrue,
    inference(fof_simplification,[status(thm)],[goal]) ).

cnf(c_0_10,negated_conjecture,
    eq2(mul_idem(X1),bfalse) != btrue,
    c_0_9 ).

cnf(c_0_11,axiom,
    mul_idem(X1) = eq(x22(X1,X1),X1),
    axiom_004 ).

cnf(c_0_12,negated_conjecture,
    eq2(eq(x22(X1,X1),X1),bfalse) != btrue,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,axiom,
    x22(s(X1),X2) = x2(X2,x22(X1,X2)),
    axiom_003 ).

cnf(c_0_14,axiom,
    x2(s(X1),X2) = s(x2(X1,X2)),
    axiom_001 ).

cnf(c_0_15,axiom,
    eq(s(X1),s(X2)) = eq(X1,X2),
    axiom_007 ).

cnf(c_0_16,negated_conjecture,
    eq2(eq(x2(X1,x22(X1,s(X1))),X1),bfalse) != btrue,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    eq2(eq(x2(X1,s(s(x2(X1,x22(X1,s(s(X1))))))),X1),bfalse) != btrue,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14]),c_0_14]),c_0_14]),c_0_15]) ).

cnf(c_0_18,axiom,
    x22(z,X1) = z,
    axiom_002 ).

cnf(c_0_19,axiom,
    x2(z,X1) = X1,
    axiom ).

cnf(c_0_20,axiom,
    eq(s(X1),z) = bfalse,
    axiom_009 ).

cnf(c_0_21,axiom,
    eq2(X1,X1) = btrue,
    axiom_011 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWX204-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n026.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 10:36:07 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/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
% 0.10/0.44  % Version: 3.5.1
% 0.10/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44  % Starting sh5l with 300s (1) cores
% 0.10/0.44  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2044121 completed with status 0
% 0.10/0.44  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44  % No SInE strategy applied
% 0.10/0.44  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.44  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.44  % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.10/0.44  % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.10/0.44  % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 2044129 completed with status 0
% 0.10/0.44  % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.10/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44  % No SInE strategy applied
% 0.10/0.44  % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.44  % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.44  % Preprocessing time       : 0.001 s
% 0.10/0.44  
% 0.10/0.44  % Proof found!
% 0.10/0.44  % SZS status Unsatisfiable
% 0.10/0.44  % SZS output start CNFRefutation
% See solution above
% 0.10/0.44  % Parsed axioms                        : 13
% 0.10/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.44  % Initial clauses                      : 13
% 0.10/0.44  % Removed in clause preprocessing      : 1
% 0.10/0.44  % Initial clauses in saturation        : 12
% 0.10/0.44  % Processed clauses                    : 17
% 0.10/0.44  % ...of these trivial                  : 0
% 0.10/0.44  % ...subsumed                          : 2
% 0.10/0.44  % ...remaining for further processing  : 15
% 0.10/0.44  % Other redundant clauses eliminated   : 0
% 0.10/0.44  % Clauses deleted for lack of memory   : 0
% 0.10/0.44  % Backward-subsumed                    : 0
% 0.10/0.44  % Backward-rewritten                   : 0
% 0.10/0.44  % Generated clauses                    : 13
% 0.10/0.44  % ...of the previous two non-redundant : 7
% 0.10/0.44  % ...aggressively subsumed             : 0
% 0.10/0.44  % Contextual simplify-reflections      : 0
% 0.10/0.44  % Paramodulations                      : 13
% 0.10/0.44  % Factorizations                       : 0
% 0.10/0.44  % NegExts                              : 0
% 0.10/0.44  % Equation resolutions                 : 0
% 0.10/0.44  % Disequality decompositions           : 0
% 0.10/0.44  % Total rewrite steps                  : 29
% 0.10/0.44  % ...of those cached                   : 8
% 0.10/0.44  % Propositional unsat checks           : 0
% 0.10/0.44  %    Propositional check models        : 0
% 0.10/0.44  %    Propositional check unsatisfiable : 0
% 0.10/0.44  %    Propositional clauses             : 0
% 0.10/0.44  %    Propositional clauses after purity: 0
% 0.10/0.44  %    Propositional unsat core size     : 0
% 0.10/0.44  %    Propositional preprocessing time  : 0.000
% 0.10/0.44  %    Propositional encoding time       : 0.000
% 0.10/0.44  %    Propositional solver time         : 0.000
% 0.10/0.44  %    Success case prop preproc time    : 0.000
% 0.10/0.44  %    Success case prop encoding time   : 0.000
% 0.10/0.44  %    Success case prop solver time     : 0.000
% 0.10/0.44  % Current number of processed clauses  : 15
% 0.10/0.44  %    Positive orientable unit clauses  : 11
% 0.10/0.44  %    Positive unorientable unit clauses: 0
% 0.10/0.44  %    Negative unit clauses             : 4
% 0.10/0.44  %    Non-unit-clauses                  : 0
% 0.10/0.44  % Current number of unprocessed clauses: 1
% 0.10/0.44  % ...number of literals in the above   : 1
% 0.10/0.44  % Current number of archived formulas  : 0
% 0.10/0.44  % Current number of archived clauses   : 1
% 0.10/0.44  % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44  % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.44  % Unit Clause-clause subsumption calls : 4
% 0.10/0.44  % Rewrite failures with RHS unbound    : 0
% 0.10/0.44  % BW rewrite match attempts            : 4
% 0.10/0.44  % BW rewrite match successes           : 0
% 0.10/0.44  % Condensation attempts                : 0
% 0.10/0.44  % Condensation successes               : 0
% 0.10/0.44  % Termbank termtop insertions          : 435
% 0.10/0.44  % Search garbage collected termcells   : 2
% 0.10/0.44  
% 0.10/0.44  % -------------------------------------------------
% 0.10/0.44  % User time                : 0.003 s
% 0.10/0.44  % System time              : 0.003 s
% 0.10/0.44  % Total time               : 0.006 s
% 0.10/0.44  % Maximum resident set size: 3632 pages
% 0.10/0.44  
% 0.10/0.44  % -------------------------------------------------
% 0.10/0.44  % User time                : 0.014 s
% 0.10/0.44  % System time              : 0.013 s
% 0.10/0.44  % Total time               : 0.027 s
% 0.10/0.44  % Maximum resident set size: 4864 pages
% 0.10/0.44  % E exiting
%------------------------------------------------------------------------------