↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWX206+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 : n005.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   : Theorem 0.12s 0.40s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   8 unt;   0 def)
%            Number of atoms       :    8 (   7 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn   3   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goal_005,conjecture,
    ? [X1] : x2(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_005) ).

fof(axiom_003,axiom,
    ! [X2] : x2(z,X2) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1] : x2(X1,X1) = X1,
    inference(assume_negation,[status(cth)],[goal_005]) ).

fof(c_0_3,negated_conjecture,
    ! [X4] : x2(X4,X4) != X4,
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X5] : x2(z,X5) = X5,
    inference(variable_rename,[status(thm)],[axiom_003]) ).

cnf(c_0_5,negated_conjecture,
    x2(X1,X1) != X1,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    x2(z,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_5,c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX206+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.08/0.34  % Computer : n005.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Mon Sep 21 10:33:18 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  Running first-order theorem proving
% 0.12/0.38  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.40  % Version: 3.5.1
% 0.12/0.40  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.40  % Starting sh5l with 300s (1) cores
% 0.12/0.40  % new_bool_3 with pid 3238124 completed with status 0
% 0.12/0.40  % Result found by new_bool_3
% 0.12/0.40  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.40  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.40  % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.12/0.40  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.40  % SubtermCWHack with pid 3238130 completed with status 0
% 0.12/0.40  % Result found by SubtermCWHack
% 0.12/0.40  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.40  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.40  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.40  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.40  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.40  % Search class: FUUPS-FFSF21-SFFFFFNN
% 0.12/0.40  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.40  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.40  % Preprocessing time       : 0.001 s
% 0.12/0.40  
% 0.12/0.40  % Proof found!
% 0.12/0.40  % SZS status Theorem
% 0.12/0.40  % SZS output start CNFRefutation
% See solution above
% 0.12/0.40  % Parsed axioms                        : 5
% 0.12/0.40  % Removed by relevancy pruning/SinE    : 1
% 0.12/0.40  % Initial clauses                      : 4
% 0.12/0.40  % Removed in clause preprocessing      : 0
% 0.12/0.40  % Initial clauses in saturation        : 4
% 0.12/0.40  % Processed clauses                    : 3
% 0.12/0.40  % ...of these trivial                  : 0
% 0.12/0.40  % ...subsumed                          : 0
% 0.12/0.40  % ...remaining for further processing  : 3
% 0.12/0.40  % Other redundant clauses eliminated   : 0
% 0.12/0.40  % Clauses deleted for lack of memory   : 0
% 0.12/0.40  % Backward-subsumed                    : 0
% 0.12/0.40  % Backward-rewritten                   : 0
% 0.12/0.40  % Generated clauses                    : 1
% 0.12/0.40  % ...of the previous two non-redundant : 0
% 0.12/0.40  % ...aggressively subsumed             : 0
% 0.12/0.40  % Contextual simplify-reflections      : 0
% 0.12/0.40  % Paramodulations                      : 1
% 0.12/0.40  % Factorizations                       : 0
% 0.12/0.40  % NegExts                              : 0
% 0.12/0.40  % Equation resolutions                 : 0
% 0.12/0.40  % Disequality decompositions           : 0
% 0.12/0.40  % Total rewrite steps                  : 0
% 0.12/0.40  % ...of those cached                   : 0
% 0.12/0.40  % Propositional unsat checks           : 0
% 0.12/0.40  %    Propositional check models        : 0
% 0.12/0.40  %    Propositional check unsatisfiable : 0
% 0.12/0.40  %    Propositional clauses             : 0
% 0.12/0.40  %    Propositional clauses after purity: 0
% 0.12/0.40  %    Propositional unsat core size     : 0
% 0.12/0.40  %    Propositional preprocessing time  : 0.000
% 0.12/0.40  %    Propositional encoding time       : 0.000
% 0.12/0.40  %    Propositional solver time         : 0.000
% 0.12/0.40  %    Success case prop preproc time    : 0.000
% 0.12/0.40  %    Success case prop encoding time   : 0.000
% 0.12/0.40  %    Success case prop solver time     : 0.000
% 0.12/0.40  % Current number of processed clauses  : 3
% 0.12/0.40  %    Positive orientable unit clauses  : 1
% 0.12/0.40  %    Positive unorientable unit clauses: 0
% 0.12/0.40  %    Negative unit clauses             : 2
% 0.12/0.40  %    Non-unit-clauses                  : 0
% 0.12/0.40  % Current number of unprocessed clauses: 1
% 0.12/0.40  % ...number of literals in the above   : 1
% 0.12/0.40  % Current number of archived formulas  : 0
% 0.12/0.40  % Current number of archived clauses   : 0
% 0.12/0.40  % Clause-clause subsumption calls (NU) : 0
% 0.12/0.40  % Rec. Clause-clause subsumption calls : 0
% 0.12/0.40  % Non-unit clause-clause subsumptions  : 0
% 0.12/0.40  % Unit Clause-clause subsumption calls : 0
% 0.12/0.40  % Rewrite failures with RHS unbound    : 0
% 0.12/0.40  % BW rewrite match attempts            : 0
% 0.12/0.40  % BW rewrite match successes           : 0
% 0.12/0.40  % Condensation attempts                : 0
% 0.12/0.40  % Condensation successes               : 0
% 0.12/0.40  % Termbank termtop insertions          : 129
% 0.12/0.40  % Search garbage collected termcells   : 16
% 0.12/0.40  
% 0.12/0.40  % -------------------------------------------------
% 0.12/0.40  % User time                : 0.003 s
% 0.12/0.40  % System time              : 0.001 s
% 0.12/0.40  % Total time               : 0.004 s
% 0.12/0.40  % Maximum resident set size: 3576 pages
% 0.12/0.40  
% 0.12/0.40  % -------------------------------------------------
% 0.12/0.40  % User time                : 0.003 s
% 0.12/0.40  % System time              : 0.005 s
% 0.12/0.40  % Total time               : 0.007 s
% 0.12/0.40  % Maximum resident set size: 4608 pages
% 0.12/0.40  % E exiting
%------------------------------------------------------------------------------