↑ 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  : SET077-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 : n014.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:16:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_singletons_are_sets_1,negated_conjecture,
    ~ member(singleton(x),universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singletons_are_sets_1) ).

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

cnf(unordered_pairs_in_universal,axiom,
    member(unordered_pair(X1,X2),universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).

cnf(c_0_3,negated_conjecture,
    ~ member(singleton(x),universal_class),
    inference(fof_simplification,[status(thm)],[prove_singletons_are_sets_1]) ).

cnf(c_0_4,negated_conjecture,
    ~ member(singleton(x),universal_class),
    c_0_3 ).

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

cnf(c_0_6,negated_conjecture,
    ~ member(unordered_pair(x,x),universal_class),
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    member(unordered_pair(X1,X2),universal_class),
    unordered_pairs_in_universal ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET077-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n014.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 04:49:49 UTC 2026
% 0.19/0.47  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.54  Running first-order theorem proving
% 0.24/0.55  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.24/0.59  % Version: 3.5.1
% 0.24/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.24/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.24/0.59  % Starting sh5l with 300s (1) cores
% 0.24/0.59  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3172128 completed with status 0
% 0.24/0.59  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59  % No SInE strategy applied
% 0.24/0.59  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.59  % Starting new_bool_3 with 311s (1) cores
% 0.24/0.59  % Starting new_bool_1 with 308s (1) cores
% 0.24/0.59  % Starting sh5l with 304s (1) cores
% 0.24/0.59  % sh5l with pid 3172139 completed with status 0
% 0.24/0.59  % Result found by sh5l
% 0.24/0.59  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59  % No SInE strategy applied
% 0.24/0.59  % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.59  % Starting new_bool_3 with 311s (1) cores
% 0.24/0.59  % Starting new_bool_1 with 308s (1) cores
% 0.24/0.59  % Starting sh5l with 304s (1) cores
% 0.24/0.59  % Preprocessing time       : 0.004 s
% 0.24/0.59  % Presaturation interreduction done
% 0.24/0.59  
% 0.24/0.59  % Proof found!
% 0.24/0.59  % SZS status Unsatisfiable
% 0.24/0.59  % SZS output start CNFRefutation
% See solution above
% 0.24/0.59  % Parsed axioms                        : 92
% 0.24/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.59  % Initial clauses                      : 92
% 0.24/0.59  % Removed in clause preprocessing      : 15
% 0.24/0.59  % Initial clauses in saturation        : 77
% 0.24/0.59  % Processed clauses                    : 7
% 0.24/0.59  % ...of these trivial                  : 0
% 0.24/0.59  % ...subsumed                          : 0
% 0.24/0.59  % ...remaining for further processing  : 7
% 0.24/0.59  % Other redundant clauses eliminated   : 0
% 0.24/0.59  % Clauses deleted for lack of memory   : 0
% 0.24/0.59  % Backward-subsumed                    : 0
% 0.24/0.59  % Backward-rewritten                   : 1
% 0.24/0.59  % Generated clauses                    : 0
% 0.24/0.59  % ...of the previous two non-redundant : 0
% 0.24/0.59  % ...aggressively subsumed             : 0
% 0.24/0.59  % Contextual simplify-reflections      : 0
% 0.24/0.59  % Paramodulations                      : 0
% 0.24/0.59  % Factorizations                       : 0
% 0.24/0.59  % NegExts                              : 0
% 0.24/0.59  % Equation resolutions                 : 0
% 0.24/0.59  % Disequality decompositions           : 0
% 0.24/0.59  % Total rewrite steps                  : 1
% 0.24/0.59  % ...of those cached                   : 0
% 0.24/0.59  % Propositional unsat checks           : 0
% 0.24/0.59  %    Propositional check models        : 0
% 0.24/0.59  %    Propositional check unsatisfiable : 0
% 0.24/0.59  %    Propositional clauses             : 0
% 0.24/0.59  %    Propositional clauses after purity: 0
% 0.24/0.59  %    Propositional unsat core size     : 0
% 0.24/0.59  %    Propositional preprocessing time  : 0.000
% 0.24/0.59  %    Propositional encoding time       : 0.000
% 0.24/0.59  %    Propositional solver time         : 0.000
% 0.24/0.59  %    Success case prop preproc time    : 0.000
% 0.24/0.59  %    Success case prop encoding time   : 0.000
% 0.24/0.59  %    Success case prop solver time     : 0.000
% 0.24/0.59  % Current number of processed clauses  : 6
% 0.24/0.59  %    Positive orientable unit clauses  : 5
% 0.24/0.59  %    Positive unorientable unit clauses: 0
% 0.24/0.59  %    Negative unit clauses             : 0
% 0.24/0.59  %    Non-unit-clauses                  : 1
% 0.24/0.59  % Current number of unprocessed clauses: 70
% 0.24/0.59  % ...number of literals in the above   : 159
% 0.24/0.59  % Current number of archived formulas  : 0
% 0.24/0.59  % Current number of archived clauses   : 16
% 0.24/0.59  % Clause-clause subsumption calls (NU) : 0
% 0.24/0.59  % Rec. Clause-clause subsumption calls : 0
% 0.24/0.59  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.59  % Unit Clause-clause subsumption calls : 0
% 0.24/0.59  % Rewrite failures with RHS unbound    : 0
% 0.24/0.59  % BW rewrite match attempts            : 1
% 0.24/0.59  % BW rewrite match successes           : 1
% 0.24/0.59  % Condensation attempts                : 7
% 0.24/0.59  % Condensation successes               : 0
% 0.24/0.59  % Termbank termtop insertions          : 3764
% 0.24/0.59  % Search garbage collected termcells   : 156
% 0.24/0.59  
% 0.24/0.59  % -------------------------------------------------
% 0.24/0.59  % User time                : 0.007 s
% 0.24/0.59  % System time              : 0.006 s
% 0.24/0.59  % Total time               : 0.014 s
% 0.24/0.59  % Maximum resident set size: 3720 pages
% 0.24/0.59  
% 0.24/0.59  % -------------------------------------------------
% 0.24/0.59  % User time                : 0.023 s
% 0.24/0.59  % System time              : 0.013 s
% 0.24/0.59  % Total time               : 0.036 s
% 0.24/0.59  % Maximum resident set size: 4864 pages
% 0.24/0.59  % E exiting
%------------------------------------------------------------------------------