↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Computer : n003.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:51:26 PM UTC 2026

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

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

cnf(complement1,axiom,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

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

cnf(regularity1,axiom,
    ( member(regular(X1),X1)
    | X1 = null_class ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).

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

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

cnf(prove_omega_is_not_null_1,negated_conjecture,
    omega = null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_omega_is_not_null_1) ).

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

cnf(c_0_8,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    inference(fof_simplification,[status(thm)],[complement1]) ).

cnf(c_0_9,plain,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    c_0_7 ).

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

cnf(c_0_11,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    c_0_8 ).

cnf(c_0_12,axiom,
    ( member(regular(X1),X1)
    | X1 = null_class ),
    regularity1 ).

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

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

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

cnf(c_0_16,negated_conjecture,
    omega = null_class,
    prove_omega_is_not_null_1 ).

cnf(c_0_17,plain,
    ( ~ member(regular(complement(X1)),X1)
    | complement(X1) = null_class ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( member(regular(X1),universal_class)
    | X1 = null_class ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_19,plain,
    ( ~ inductive(X1)
    | member(null_class,X1) ),
    c_0_14 ).

cnf(c_0_20,plain,
    inductive(null_class),
    inference(rw,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    member(null_class,null_class),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_21]),c_0_13]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM190-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n003.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 02:12:31 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.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  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3185963 completed with status 0
% 0.10/0.43  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 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  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43  % No SInE strategy applied
% 0.10/0.43  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.10/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.10/0.43  % Starting new_bool_3 with 311s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 308s (1) cores
% 0.10/0.43  % Starting sh5l with 304s (1) cores
% 0.10/0.43  % SubtermCWHack with pid 3185970 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  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43  % No SInE strategy applied
% 0.10/0.43  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.10/0.43  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43  % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.003 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                        : 159
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.43  % Initial clauses                      : 159
% 0.10/0.43  % Removed in clause preprocessing      : 19
% 0.10/0.43  % Initial clauses in saturation        : 140
% 0.10/0.43  % Processed clauses                    : 104
% 0.10/0.43  % ...of these trivial                  : 5
% 0.10/0.43  % ...subsumed                          : 9
% 0.10/0.43  % ...remaining for further processing  : 90
% 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                    : 4
% 0.10/0.43  % Backward-rewritten                   : 19
% 0.10/0.43  % Generated clauses                    : 88
% 0.10/0.43  % ...of the previous two non-redundant : 72
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 1
% 0.10/0.43  % Paramodulations                      : 84
% 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                  : 47
% 0.10/0.43  % ...of those cached                   : 24
% 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  : 63
% 0.10/0.43  %    Positive orientable unit clauses  : 16
% 0.10/0.43  %    Positive unorientable unit clauses: 0
% 0.10/0.43  %    Negative unit clauses             : 1
% 0.10/0.43  %    Non-unit-clauses                  : 46
% 0.10/0.43  % Current number of unprocessed clauses: 101
% 0.10/0.43  % ...number of literals in the above   : 248
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 44
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 296
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 225
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 13
% 0.10/0.43  % Unit Clause-clause subsumption calls : 48
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 19
% 0.10/0.43  % BW rewrite match successes           : 12
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 7335
% 0.10/0.43  % Search garbage collected termcells   : 285
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.014 s
% 0.10/0.43  % System time              : 0.004 s
% 0.10/0.43  % Total time               : 0.018 s
% 0.10/0.44  % Maximum resident set size: 4036 pages
% 0.10/0.44  
% 0.10/0.44  % -------------------------------------------------
% 0.10/0.44  % User time                : 0.040 s
% 0.10/0.44  % System time              : 0.017 s
% 0.10/0.44  % Total time               : 0.057 s
% 0.10/0.44  % Maximum resident set size: 4864 pages
% 0.10/0.44  % E exiting
%------------------------------------------------------------------------------