↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN331-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n001.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:23:42 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.60s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   12 (   6 unt;   3 nHn;   7 RR)
%            Number of literals    :   18 (   0 equ;   6 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   21 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause3,negated_conjecture,
    ( ~ f(z(X1,X2),z(X1,X2))
    | f(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause5,negated_conjecture,
    ( f(z(X2,X1),z(X2,X1))
    | f(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause7,negated_conjecture,
    ~ f(z(X1,X2),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

cnf(c_0_3,negated_conjecture,
    ( ~ f(z(X1,X2),z(X1,X2))
    | f(X1,X2) ),
    inference(fof_simplification,[status(thm)],[clause3]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ f(z(X1,X2),z(X1,X2))
    | f(X1,X2) ),
    c_0_3 ).

cnf(c_0_5,negated_conjecture,
    ( f(z(X2,X1),z(X2,X1))
    | f(X1,X2) ),
    clause5 ).

cnf(c_0_6,negated_conjecture,
    ( f(X2,X1)
    | f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,negated_conjecture,
    ~ f(z(X1,X2),X2),
    inference(fof_simplification,[status(thm)],[clause7]) ).

cnf(c_0_8,negated_conjecture,
    f(X1,X1),
    inference(ef,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ f(z(X1,X2),X2),
    c_0_7 ).

cnf(c_0_10,negated_conjecture,
    f(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_8])]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
    [proof] ).

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