↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET080-6 : 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 : 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 02:13:28 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(unordered_pair3,axiom,
    ( ~ member(X1,universal_class)
    | member(X1,unordered_pair(X2,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).

cnf(subclass_members,axiom,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(inductive1,axiom,
    ( ~ inductive(X1)
    | member(null_class,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inductive1) ).

cnf(prove_null_class_in_its_singleton_1,negated_conjecture,
    ~ member(null_class,singleton(null_class)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_null_class_in_its_singleton_1) ).

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

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(omega_is_inductive1,axiom,
    inductive(omega),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).

cnf(c_0_7,plain,
    ( ~ member(X1,universal_class)
    | member(X1,unordered_pair(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[unordered_pair3]) ).

cnf(c_0_8,plain,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    inference(fof_simplification,[status(thm)],[subclass_members]) ).

cnf(c_0_9,plain,
    ( ~ inductive(X1)
    | member(null_class,X1) ),
    inference(fof_simplification,[status(thm)],[inductive1]) ).

cnf(c_0_10,negated_conjecture,
    ~ member(null_class,singleton(null_class)),
    inference(fof_simplification,[status(thm)],[prove_null_class_in_its_singleton_1]) ).

cnf(c_0_11,plain,
    ( ~ member(X1,universal_class)
    | member(X1,unordered_pair(X2,X1)) ),
    c_0_7 ).

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

cnf(c_0_13,plain,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    c_0_8 ).

cnf(c_0_14,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

cnf(c_0_15,plain,
    ( ~ inductive(X1)
    | member(null_class,X1) ),
    c_0_9 ).

cnf(c_0_16,axiom,
    inductive(omega),
    omega_is_inductive1 ).

cnf(c_0_17,negated_conjecture,
    ~ member(null_class,singleton(null_class)),
    c_0_10 ).

cnf(c_0_18,plain,
    ( ~ member(X1,universal_class)
    | member(X1,singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_19,plain,
    ( ~ member(X1,X2)
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    member(null_class,omega),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ~ member(null_class,universal_class),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET080-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n001.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 04:56:14 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.12/0.45  % Version: 3.5.1
% 0.12/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % sh5l with pid 2231708 completed with status 0
% 0.12/0.45  % Result found by sh5l
% 0.12/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.45  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.12/0.45  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45  % SubtermCWHack with pid 2231709 completed with status 0
% 0.12/0.45  % Result found by SubtermCWHack
% 0.12/0.45  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.45  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45  % Starting sh5l with 300s (1) cores
% 0.12/0.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.45  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.45  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.12/0.45  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.45  % Starting SubtermCWHack with 28s (1) cores
% 0.12/0.45  % Preprocessing time       : 0.002 s
% 0.12/0.45  
% 0.12/0.45  % Proof found!
% 0.12/0.45  % SZS status Unsatisfiable
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 92
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 9
% 0.12/0.45  % Initial clauses                      : 83
% 0.12/0.45  % Removed in clause preprocessing      : 0
% 0.12/0.45  % Initial clauses in saturation        : 83
% 0.12/0.45  % Processed clauses                    : 63
% 0.12/0.45  % ...of these trivial                  : 0
% 0.12/0.45  % ...subsumed                          : 1
% 0.12/0.45  % ...remaining for further processing  : 62
% 0.12/0.45  % Other redundant clauses eliminated   : 2
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 0
% 0.12/0.45  % Backward-rewritten                   : 1
% 0.12/0.45  % Generated clauses                    : 64
% 0.12/0.45  % ...of the previous two non-redundant : 48
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 0
% 0.12/0.45  % Paramodulations                      : 62
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 2
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 4
% 0.12/0.45  % ...of those cached                   : 0
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 59
% 0.12/0.45  %    Positive orientable unit clauses  : 21
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 2
% 0.12/0.45  %    Non-unit-clauses                  : 36
% 0.12/0.45  % Current number of unprocessed clauses: 65
% 0.12/0.45  % ...number of literals in the above   : 158
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 1
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 287
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 254
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 1
% 0.12/0.45  % Unit Clause-clause subsumption calls : 30
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 6
% 0.12/0.45  % BW rewrite match successes           : 1
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 2955
% 0.12/0.45  % Search garbage collected termcells   : 192
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.006 s
% 0.12/0.45  % System time              : 0.002 s
% 0.12/0.45  % Total time               : 0.009 s
% 0.12/0.45  % Maximum resident set size: 3720 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.009 s
% 0.12/0.45  % System time              : 0.007 s
% 0.12/0.45  % Total time               : 0.017 s
% 0.12/0.45  % Maximum resident set size: 4608 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------