↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM844+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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 01:50:49 PM UTC 2026

% Result   : Theorem 0.12s 0.41s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (  16 unt;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   5   ~;   0   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof('holds(266, 415, 3)',conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) = vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(266, 415, 3)') ).

fof('qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))',axiom,
    ! [X75,X76] :
      ( vplus(X75,v1) = vsucc(X75)
      & vplus(X75,vsucc(X76)) = vsucc(vplus(X75,X76)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).

fof('ass(cond(61, 0), 0)',axiom,
    ! [X67,X68] : vplus(X68,X67) = vplus(X67,X68),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).

fof('ass(cond(33, 0), 0)',axiom,
    ! [X72,X73,X74] : vplus(vplus(X72,X73),X74) = vplus(X72,vplus(X73,X74)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).

fof(c_0_4,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(assume_negation,[status(cth)],['holds(266, 415, 3)']) ).

fof(c_0_5,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X192,X193] :
      ( vplus(X192,v1) = vsucc(X192)
      & vplus(X192,vsucc(X193)) = vsucc(vplus(X192,X193)) ),
    inference(variable_rename,[status(thm)],['qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))']) ).

fof(c_0_8,plain,
    ! [X184,X185] : vplus(X185,X184) = vplus(X184,X185),
    inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).

fof(c_0_9,plain,
    ! [X189,X190,X191] : vplus(vplus(X189,X190),X191) = vplus(X189,vplus(X190,X191)),
    inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).

cnf(c_0_10,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vsucc(vd411))) != vplus(vmul(vd411,vd413),vplus(vsucc(vd411),vd413)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    vplus(X1,v1) = vsucc(X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    vplus(X1,X2) = vplus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    vplus(vmul(vd411,vd413),vplus(vd413,vplus(vd411,v1))) != vplus(vmul(vd411,vd413),vplus(vplus(vd411,v1),vd413)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

cnf(c_0_15,plain,
    vplus(X1,X2) = vplus(X2,X1),
    c_0_12 ).

cnf(c_0_16,plain,
    vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
    c_0_13 ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[c_0_14,c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM844+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 03:15:31 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.12/0.41  % Version: 3.5.1
% 0.12/0.41  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.41  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.41  % Starting sh5l with 300s (1) cores
% 0.12/0.41  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2304265 completed with status 0
% 0.12/0.41  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41  % No SInE strategy applied
% 0.12/0.41  % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.12/0.41  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41  % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.12/0.41  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.12/0.41  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.41  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2304272 completed with status 0
% 0.12/0.41  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.41  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.41  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.41  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.41  % No SInE strategy applied
% 0.12/0.41  % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.12/0.41  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.41  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.41  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.41  % Preprocessing time       : 0.002 s
% 0.12/0.41  % Presaturation interreduction done
% 0.12/0.41  
% 0.12/0.41  % Proof found!
% 0.12/0.41  % SZS status Theorem
% 0.12/0.41  % SZS output start CNFRefutation
% See solution above
% 0.12/0.41  % Parsed axioms                        : 54
% 0.12/0.41  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.41  % Initial clauses                      : 64
% 0.12/0.41  % Removed in clause preprocessing      : 3
% 0.12/0.41  % Initial clauses in saturation        : 61
% 0.12/0.41  % Processed clauses                    : 5
% 0.12/0.41  % ...of these trivial                  : 0
% 0.12/0.41  % ...subsumed                          : 0
% 0.12/0.41  % ...remaining for further processing  : 4
% 0.12/0.41  % Other redundant clauses eliminated   : 0
% 0.12/0.41  % Clauses deleted for lack of memory   : 0
% 0.12/0.41  % Backward-subsumed                    : 0
% 0.12/0.41  % Backward-rewritten                   : 0
% 0.12/0.41  % Generated clauses                    : 0
% 0.12/0.41  % ...of the previous two non-redundant : 0
% 0.12/0.41  % ...aggressively subsumed             : 0
% 0.12/0.41  % Contextual simplify-reflections      : 0
% 0.12/0.41  % Paramodulations                      : 0
% 0.12/0.41  % Factorizations                       : 0
% 0.12/0.41  % NegExts                              : 0
% 0.12/0.41  % Equation resolutions                 : 0
% 0.12/0.41  % Disequality decompositions           : 0
% 0.12/0.41  % Total rewrite steps                  : 0
% 0.12/0.41  % ...of those cached                   : 0
% 0.12/0.41  % Propositional unsat checks           : 0
% 0.12/0.41  %    Propositional check models        : 0
% 0.12/0.41  %    Propositional check unsatisfiable : 0
% 0.12/0.41  %    Propositional clauses             : 0
% 0.12/0.41  %    Propositional clauses after purity: 0
% 0.12/0.41  %    Propositional unsat core size     : 0
% 0.12/0.41  %    Propositional preprocessing time  : 0.000
% 0.12/0.41  %    Propositional encoding time       : 0.000
% 0.12/0.41  %    Propositional solver time         : 0.000
% 0.12/0.41  %    Success case prop preproc time    : 0.000
% 0.12/0.41  %    Success case prop encoding time   : 0.000
% 0.12/0.41  %    Success case prop solver time     : 0.000
% 0.12/0.41  % Current number of processed clauses  : 4
% 0.12/0.41  %    Positive orientable unit clauses  : 3
% 0.12/0.41  %    Positive unorientable unit clauses: 0
% 0.12/0.41  %    Negative unit clauses             : 1
% 0.12/0.41  %    Non-unit-clauses                  : 0
% 0.12/0.41  % Current number of unprocessed clauses: 56
% 0.12/0.41  % ...number of literals in the above   : 109
% 0.12/0.41  % Current number of archived formulas  : 0
% 0.12/0.41  % Current number of archived clauses   : 1
% 0.12/0.41  % Clause-clause subsumption calls (NU) : 0
% 0.12/0.41  % Rec. Clause-clause subsumption calls : 0
% 0.12/0.41  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.41  % Unit Clause-clause subsumption calls : 0
% 0.12/0.41  % Rewrite failures with RHS unbound    : 0
% 0.12/0.41  % BW rewrite match attempts            : 0
% 0.12/0.41  % BW rewrite match successes           : 0
% 0.12/0.41  % Condensation attempts                : 0
% 0.12/0.41  % Condensation successes               : 0
% 0.12/0.41  % Termbank termtop insertions          : 3619
% 0.12/0.41  % Search garbage collected termcells   : 667
% 0.12/0.41  
% 0.12/0.41  % -------------------------------------------------
% 0.12/0.41  % User time                : 0.005 s
% 0.12/0.41  % System time              : 0.005 s
% 0.12/0.41  % Total time               : 0.010 s
% 0.12/0.41  % Maximum resident set size: 3716 pages
% 0.12/0.41  
% 0.12/0.41  % -------------------------------------------------
% 0.12/0.41  % User time                : 0.014 s
% 0.12/0.41  % System time              : 0.014 s
% 0.12/0.41  % Total time               : 0.028 s
% 0.12/0.41  % Maximum resident set size: 4864 pages
% 0.12/0.41  % E exiting
%------------------------------------------------------------------------------