↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET082-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.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:13:29 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_singleton_is_null_class_2,negated_conjecture,
    singleton(x) != null_class,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_is_null_class_2) ).

cnf(singleton_set,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).

cnf(prove_singleton_is_null_class_1,negated_conjecture,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_is_null_class_1) ).

cnf(null_unordered_pair,axiom,
    ( member(X2,universal_class)
    | member(X1,universal_class)
    | unordered_pair(X1,X2) = null_class ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_unordered_pair) ).

cnf(c_0_4,negated_conjecture,
    singleton(x) != null_class,
    inference(fof_simplification,[status(thm)],[prove_singleton_is_null_class_2]) ).

cnf(c_0_5,negated_conjecture,
    singleton(x) != null_class,
    c_0_4 ).

cnf(c_0_6,axiom,
    unordered_pair(X1,X1) = singleton(X1),
    singleton_set ).

cnf(c_0_7,negated_conjecture,
    ~ member(x,universal_class),
    inference(fof_simplification,[status(thm)],[prove_singleton_is_null_class_1]) ).

cnf(c_0_8,negated_conjecture,
    unordered_pair(x,x) != null_class,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,axiom,
    ( member(X2,universal_class)
    | member(X1,universal_class)
    | unordered_pair(X1,X2) = null_class ),
    null_unordered_pair ).

cnf(c_0_10,negated_conjecture,
    ~ member(x,universal_class),
    c_0_7 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET082-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 04:46:12 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.10/0.43  % Version: 3.5.1
% 0.10/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43  % Starting sh5l with 300s (1) cores
% 0.10/0.43  % new_bool_3 with pid 1460679 completed with status 0
% 0.10/0.43  % Result found by new_bool_3
% 0.10/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % SubtermCWHack with pid 1460682 completed with status 0
% 0.10/0.43  % Result found by SubtermCWHack
% 0.10/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.002 s
% 0.10/0.43  
% 0.10/0.43  % Proof found!
% 0.10/0.43  % SZS status Unsatisfiable
% 0.10/0.43  % SZS output start CNFRefutation
% See solution above
% 0.10/0.43  % Parsed axioms                        : 127
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 83
% 0.10/0.43  % Initial clauses                      : 44
% 0.10/0.43  % Removed in clause preprocessing      : 0
% 0.10/0.43  % Initial clauses in saturation        : 44
% 0.10/0.43  % Processed clauses                    : 44
% 0.10/0.43  % ...of these trivial                  : 3
% 0.10/0.43  % ...subsumed                          : 7
% 0.10/0.43  % ...remaining for further processing  : 34
% 0.10/0.43  % Other redundant clauses eliminated   : 2
% 0.10/0.43  % Clauses deleted for lack of memory   : 0
% 0.10/0.43  % Backward-subsumed                    : 0
% 0.10/0.43  % Backward-rewritten                   : 2
% 0.10/0.43  % Generated clauses                    : 142
% 0.10/0.43  % ...of the previous two non-redundant : 71
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 0
% 0.10/0.43  % Paramodulations                      : 140
% 0.10/0.43  % Factorizations                       : 0
% 0.10/0.43  % NegExts                              : 0
% 0.10/0.43  % Equation resolutions                 : 2
% 0.10/0.43  % Disequality decompositions           : 0
% 0.10/0.43  % Total rewrite steps                  : 55
% 0.10/0.43  % ...of those cached                   : 36
% 0.10/0.43  % Propositional unsat checks           : 0
% 0.10/0.43  %    Propositional check models        : 0
% 0.10/0.43  %    Propositional check unsatisfiable : 0
% 0.10/0.43  %    Propositional clauses             : 0
% 0.10/0.43  %    Propositional clauses after purity: 0
% 0.10/0.43  %    Propositional unsat core size     : 0
% 0.10/0.43  %    Propositional preprocessing time  : 0.000
% 0.10/0.43  %    Propositional encoding time       : 0.000
% 0.10/0.43  %    Propositional solver time         : 0.000
% 0.10/0.43  %    Success case prop preproc time    : 0.000
% 0.10/0.43  %    Success case prop encoding time   : 0.000
% 0.10/0.43  %    Success case prop solver time     : 0.000
% 0.10/0.43  % Current number of processed clauses  : 30
% 0.10/0.43  %    Positive orientable unit clauses  : 15
% 0.10/0.43  %    Positive unorientable unit clauses: 2
% 0.10/0.43  %    Negative unit clauses             : 3
% 0.10/0.43  %    Non-unit-clauses                  : 10
% 0.10/0.43  % Current number of unprocessed clauses: 71
% 0.10/0.43  % ...number of literals in the above   : 156
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 2
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 19
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 19
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 3
% 0.10/0.43  % Unit Clause-clause subsumption calls : 1
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 18
% 0.10/0.43  % BW rewrite match successes           : 13
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 2451
% 0.10/0.43  % Search garbage collected termcells   : 455
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.002 s
% 0.10/0.43  % System time              : 0.006 s
% 0.10/0.43  % Total time               : 0.008 s
% 0.10/0.43  % Maximum resident set size: 3732 pages
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.005 s
% 0.10/0.43  % System time              : 0.012 s
% 0.10/0.43  % Total time               : 0.017 s
% 0.10/0.43  % Maximum resident set size: 4864 pages
% 0.10/0.43  % E exiting
%------------------------------------------------------------------------------