↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET146-6 : 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 : n019.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:44 PM UTC 2026

% Result   : Unsatisfiable 0.27s 0.59s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   24 (   9 unt;   4 nHn;  17 RR)
%            Number of literals    :   42 (  10 equ;  21 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (   8 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(intersection1,axiom,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

cnf(prove_intersection_with_null_class_1,negated_conjecture,
    intersection(null_class,x) != null_class,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_with_null_class_1) ).

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

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

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

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

cnf(c_0_10,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,complement(X2)) ),
    c_0_7 ).

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

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

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

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

cnf(c_0_15,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    inference(fof_simplification,[status(thm)],[intersection1]) ).

cnf(c_0_16,plain,
    complement(universal_class) = null_class,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X2) ),
    c_0_15 ).

cnf(c_0_18,negated_conjecture,
    intersection(null_class,x) != null_class,
    inference(fof_simplification,[status(thm)],[prove_intersection_with_null_class_1]) ).

cnf(c_0_19,plain,
    ~ member(X1,null_class),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_12]) ).

cnf(c_0_20,plain,
    ( member(regular(intersection(X1,X2)),X1)
    | intersection(X1,X2) = null_class ),
    inference(spm,[status(thm)],[c_0_17,c_0_11]) ).

cnf(c_0_21,negated_conjecture,
    intersection(null_class,x) != null_class,
    c_0_18 ).

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

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET146-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44  % Computer : n019.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Mon Sep 21 04:56:49 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.52  Running first-order theorem proving
% 0.27/0.52  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.27/0.59  % Version: 3.5.1
% 0.27/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.27/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.27/0.59  % Starting sh5l with 300s (1) cores
% 0.27/0.59  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1732234 completed with status 0
% 0.27/0.59  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.27/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.59  % No SInE strategy applied
% 0.27/0.59  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.27/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.27/0.59  % Starting new_bool_3 with 311s (1) cores
% 0.27/0.59  % Starting new_bool_1 with 308s (1) cores
% 0.27/0.59  % Starting sh5l with 304s (1) cores
% 0.27/0.59  % SubtermCWHack with pid 1732241 completed with status 0
% 0.27/0.59  % Result found by SubtermCWHack
% 0.27/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.59  % No SInE strategy applied
% 0.27/0.59  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.27/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.59  % Preprocessing time       : 0.004 s
% 0.27/0.59  
% 0.27/0.59  % Proof found!
% 0.27/0.59  % SZS status Unsatisfiable
% 0.27/0.59  % SZS output start CNFRefutation
% See solution above
% 0.27/0.59  % Parsed axioms                        : 113
% 0.27/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.27/0.59  % Initial clauses                      : 113
% 0.27/0.59  % Removed in clause preprocessing      : 17
% 0.27/0.59  % Initial clauses in saturation        : 96
% 0.27/0.59  % Processed clauses                    : 148
% 0.27/0.59  % ...of these trivial                  : 0
% 0.27/0.59  % ...subsumed                          : 29
% 0.27/0.59  % ...remaining for further processing  : 119
% 0.27/0.59  % Other redundant clauses eliminated   : 2
% 0.27/0.59  % Clauses deleted for lack of memory   : 0
% 0.27/0.59  % Backward-subsumed                    : 1
% 0.27/0.59  % Backward-rewritten                   : 5
% 0.27/0.59  % Generated clauses                    : 263
% 0.27/0.59  % ...of the previous two non-redundant : 232
% 0.27/0.59  % ...aggressively subsumed             : 0
% 0.27/0.59  % Contextual simplify-reflections      : 1
% 0.27/0.59  % Paramodulations                      : 261
% 0.27/0.59  % Factorizations                       : 0
% 0.27/0.59  % NegExts                              : 0
% 0.27/0.59  % Equation resolutions                 : 2
% 0.27/0.59  % Disequality decompositions           : 0
% 0.27/0.59  % Total rewrite steps                  : 28
% 0.27/0.59  % ...of those cached                   : 13
% 0.27/0.59  % Propositional unsat checks           : 0
% 0.27/0.59  %    Propositional check models        : 0
% 0.27/0.59  %    Propositional check unsatisfiable : 0
% 0.27/0.59  %    Propositional clauses             : 0
% 0.27/0.59  %    Propositional clauses after purity: 0
% 0.27/0.59  %    Propositional unsat core size     : 0
% 0.27/0.59  %    Propositional preprocessing time  : 0.000
% 0.27/0.59  %    Propositional encoding time       : 0.000
% 0.27/0.59  %    Propositional solver time         : 0.000
% 0.27/0.59  %    Success case prop preproc time    : 0.000
% 0.27/0.59  %    Success case prop encoding time   : 0.000
% 0.27/0.59  %    Success case prop solver time     : 0.000
% 0.27/0.59  % Current number of processed clauses  : 111
% 0.27/0.59  %    Positive orientable unit clauses  : 26
% 0.27/0.59  %    Positive unorientable unit clauses: 1
% 0.27/0.59  %    Negative unit clauses             : 1
% 0.27/0.59  %    Non-unit-clauses                  : 83
% 0.27/0.59  % Current number of unprocessed clauses: 178
% 0.27/0.59  % ...number of literals in the above   : 445
% 0.27/0.59  % Current number of archived formulas  : 0
% 0.27/0.59  % Current number of archived clauses   : 23
% 0.27/0.59  % Clause-clause subsumption calls (NU) : 851
% 0.27/0.59  % Rec. Clause-clause subsumption calls : 526
% 0.27/0.59  % Non-unit clause-clause subsumptions  : 24
% 0.27/0.59  % Unit Clause-clause subsumption calls : 64
% 0.27/0.59  % Rewrite failures with RHS unbound    : 0
% 0.27/0.59  % BW rewrite match attempts            : 7
% 0.27/0.59  % BW rewrite match successes           : 5
% 0.27/0.59  % Condensation attempts                : 0
% 0.27/0.59  % Condensation successes               : 0
% 0.27/0.59  % Termbank termtop insertions          : 8166
% 0.27/0.59  % Search garbage collected termcells   : 185
% 0.27/0.59  
% 0.27/0.59  % -------------------------------------------------
% 0.27/0.59  % User time                : 0.022 s
% 0.27/0.59  % System time              : 0.010 s
% 0.27/0.59  % Total time               : 0.033 s
% 0.27/0.59  % Maximum resident set size: 3736 pages
% 0.27/0.59  
% 0.27/0.59  % -------------------------------------------------
% 0.27/0.59  % User time                : 0.093 s
% 0.27/0.59  % System time              : 0.027 s
% 0.27/0.59  % Total time               : 0.121 s
% 0.27/0.59  % Maximum resident set size: 4864 pages
% 0.27/0.59  % E exiting
%------------------------------------------------------------------------------