↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM139-1 : 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 : n020.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:44:24 PM UTC 2026

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

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

cnf(prove_complete_induction3_1,negated_conjecture,
    ~ member(not_subclass_element(intersection(power_class(x),z),x),z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complete_induction3_1) ).

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

cnf(prove_complete_induction3_2,negated_conjecture,
    ~ subclass(intersection(power_class(x),z),x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_complete_induction3_2) ).

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

cnf(c_0_5,negated_conjecture,
    ~ member(not_subclass_element(intersection(power_class(x),z),x),z),
    inference(fof_simplification,[status(thm)],[prove_complete_induction3_1]) ).

cnf(c_0_6,plain,
    ( ~ member(X1,intersection(X2,X3))
    | member(X1,X3) ),
    c_0_4 ).

cnf(c_0_7,axiom,
    ( subclass(X1,X2)
    | member(not_subclass_element(X1,X2),X1) ),
    not_subclass_members1 ).

cnf(c_0_8,negated_conjecture,
    ~ subclass(intersection(power_class(x),z),x),
    inference(fof_simplification,[status(thm)],[prove_complete_induction3_2]) ).

cnf(c_0_9,negated_conjecture,
    ~ member(not_subclass_element(intersection(power_class(x),z),x),z),
    c_0_5 ).

cnf(c_0_10,plain,
    ( subclass(intersection(X1,X2),X3)
    | member(not_subclass_element(intersection(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ~ subclass(intersection(power_class(x),z),x),
    c_0_8 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM139-1 : 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.38  % Computer : n020.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 02:08:33 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.46  Running first-order theorem proving
% 0.16/0.46  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.16/0.52  % Version: 3.5.1
% 0.16/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52  % Starting new_bool_1 with 300s (1) cores
% 0.16/0.52  % Starting sh5l with 300s (1) cores
% 0.16/0.52  % new_bool_3 with pid 1768902 completed with status 0
% 0.16/0.52  % Result found by new_bool_3
% 0.16/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.52  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.16/0.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52  % SubtermCWHack with pid 1768906 completed with status 0
% 0.16/0.52  % Result found by SubtermCWHack
% 0.16/0.52  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.52  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.52  % Starting new_bool_3 with 300s (1) cores
% 0.16/0.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.52  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.16/0.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.52  % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.52  % Preprocessing time       : 0.002 s
% 0.16/0.52  
% 0.16/0.52  % Proof found!
% 0.16/0.52  % SZS status Unsatisfiable
% 0.16/0.52  % SZS output start CNFRefutation
% See solution above
% 0.16/0.52  % Parsed axioms                        : 160
% 0.16/0.52  % Removed by relevancy pruning/SinE    : 113
% 0.16/0.52  % Initial clauses                      : 47
% 0.16/0.52  % Removed in clause preprocessing      : 0
% 0.16/0.52  % Initial clauses in saturation        : 47
% 0.16/0.52  % Processed clauses                    : 82
% 0.16/0.52  % ...of these trivial                  : 0
% 0.16/0.52  % ...subsumed                          : 11
% 0.16/0.52  % ...remaining for further processing  : 71
% 0.16/0.52  % Other redundant clauses eliminated   : 2
% 0.16/0.52  % Clauses deleted for lack of memory   : 0
% 0.16/0.52  % Backward-subsumed                    : 0
% 0.16/0.52  % Backward-rewritten                   : 0
% 0.16/0.52  % Generated clauses                    : 133
% 0.16/0.52  % ...of the previous two non-redundant : 108
% 0.16/0.52  % ...aggressively subsumed             : 0
% 0.16/0.52  % Contextual simplify-reflections      : 0
% 0.16/0.52  % Paramodulations                      : 131
% 0.16/0.52  % Factorizations                       : 0
% 0.16/0.52  % NegExts                              : 0
% 0.16/0.52  % Equation resolutions                 : 2
% 0.16/0.52  % Disequality decompositions           : 0
% 0.16/0.52  % Total rewrite steps                  : 9
% 0.16/0.52  % ...of those cached                   : 3
% 0.16/0.52  % Propositional unsat checks           : 0
% 0.16/0.52  %    Propositional check models        : 0
% 0.16/0.52  %    Propositional check unsatisfiable : 0
% 0.16/0.52  %    Propositional clauses             : 0
% 0.16/0.52  %    Propositional clauses after purity: 0
% 0.16/0.52  %    Propositional unsat core size     : 0
% 0.16/0.52  %    Propositional preprocessing time  : 0.000
% 0.16/0.52  %    Propositional encoding time       : 0.000
% 0.16/0.52  %    Propositional solver time         : 0.000
% 0.16/0.52  %    Success case prop preproc time    : 0.000
% 0.16/0.52  %    Success case prop encoding time   : 0.000
% 0.16/0.52  %    Success case prop solver time     : 0.000
% 0.16/0.52  % Current number of processed clauses  : 69
% 0.16/0.52  %    Positive orientable unit clauses  : 13
% 0.16/0.52  %    Positive unorientable unit clauses: 0
% 0.16/0.52  %    Negative unit clauses             : 2
% 0.16/0.52  %    Non-unit-clauses                  : 54
% 0.16/0.52  % Current number of unprocessed clauses: 60
% 0.16/0.52  % ...number of literals in the above   : 176
% 0.16/0.52  % Current number of archived formulas  : 0
% 0.16/0.52  % Current number of archived clauses   : 0
% 0.16/0.52  % Clause-clause subsumption calls (NU) : 353
% 0.16/0.52  % Rec. Clause-clause subsumption calls : 312
% 0.16/0.52  % Non-unit clause-clause subsumptions  : 11
% 0.16/0.52  % Unit Clause-clause subsumption calls : 2
% 0.16/0.52  % Rewrite failures with RHS unbound    : 0
% 0.16/0.52  % BW rewrite match attempts            : 2
% 0.16/0.52  % BW rewrite match successes           : 0
% 0.16/0.52  % Condensation attempts                : 0
% 0.16/0.52  % Condensation successes               : 0
% 0.16/0.52  % Termbank termtop insertions          : 4176
% 0.16/0.52  % Search garbage collected termcells   : 614
% 0.16/0.52  
% 0.16/0.52  % -------------------------------------------------
% 0.16/0.52  % User time                : 0.009 s
% 0.16/0.52  % System time              : 0.004 s
% 0.16/0.52  % Total time               : 0.012 s
% 0.16/0.52  % Maximum resident set size: 4036 pages
% 0.16/0.52  
% 0.16/0.52  % -------------------------------------------------
% 0.16/0.52  % User time                : 0.015 s
% 0.16/0.52  % System time              : 0.012 s
% 0.16/0.52  % Total time               : 0.027 s
% 0.16/0.52  % Maximum resident set size: 4864 pages
% 0.16/0.52  % E exiting
%------------------------------------------------------------------------------