↑ 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  : SET076-7 : 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 : 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:16:25 PM UTC 2026

% Result   : Unsatisfiable 19.20s 3.25s
% Output   : CNFRefutation 19.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   8 unt;   7 nHn;  15 RR)
%            Number of literals    :   36 (   9 equ;  12 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

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

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

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_unordered_pair_is_subset_3,negated_conjecture,
    ~ subclass(unordered_pair(x,y),z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_3) ).

cnf(prove_unordered_pair_is_subset_1,negated_conjecture,
    member(x,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_1) ).

cnf(prove_unordered_pair_is_subset_2,negated_conjecture,
    member(y,z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_2) ).

cnf(c_0_6,plain,
    ( ~ member(X1,unordered_pair(X2,X3))
    | X1 = X3
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).

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

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

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

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

cnf(c_0_11,plain,
    ( subclass(unordered_pair(X1,X2),X3)
    | not_subclass_element(unordered_pair(X1,X2),X3) = X2
    | not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ~ subclass(unordered_pair(x,y),z),
    inference(fof_simplification,[status(thm)],[prove_unordered_pair_is_subset_3]) ).

cnf(c_0_13,plain,
    ( ~ member(X2,X3)
    | subclass(unordered_pair(X1,X2),X3)
    | not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ subclass(unordered_pair(x,y),z),
    c_0_12 ).

cnf(c_0_15,plain,
    ( ~ member(X2,X3)
    | ~ member(X1,X3)
    | subclass(unordered_pair(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_10,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    member(x,z),
    prove_unordered_pair_is_subset_1 ).

cnf(c_0_17,negated_conjecture,
    member(y,z),
    prove_unordered_pair_is_subset_2 ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET076-7 : 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 : n019.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:50:20 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  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
% 19.20/3.25  % Version: 3.5.1
% 19.20/3.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 19.20/3.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.20/3.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 19.20/3.25  % Starting new_bool_3 with 300s (1) cores
% 19.20/3.25  % Starting new_bool_1 with 300s (1) cores
% 19.20/3.25  % Starting sh5l with 300s (1) cores
% 19.20/3.25  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1719575 completed with status 0
% 19.20/3.25  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 19.20/3.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 19.20/3.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.20/3.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 19.20/3.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.20/3.25  % No SInE strategy applied
% 19.20/3.25  % Search class: FGHSM-FFLM31-DFFFFFNN
% 19.20/3.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.20/3.25  % Starting SubtermCWHack with 136s (1) cores
% 19.20/3.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 19.20/3.25  % Starting new_bool_3 with 311s (1) cores
% 19.20/3.25  % Starting new_bool_1 with 308s (1) cores
% 19.20/3.25  % Starting sh5l with 304s (1) cores
% 19.20/3.25  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1719586 completed with status 0
% 19.20/3.25  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 19.20/3.25  % Preprocessing class: FSLSSMSMSSSNFFN.
% 19.20/3.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.20/3.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 19.20/3.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.20/3.25  % No SInE strategy applied
% 19.20/3.25  % Search class: FGHSM-FFLM31-DFFFFFNN
% 19.20/3.25  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.20/3.25  % Starting SubtermCWHack with 136s (1) cores
% 19.20/3.25  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 19.20/3.25  % Preprocessing time       : 0.002 s
% 19.20/3.25  % Presaturation interreduction done
% 19.20/3.25  
% 19.20/3.25  % Proof found!
% 19.20/3.25  % SZS status Unsatisfiable
% 19.20/3.25  % SZS output start CNFRefutation
% See solution above
% 19.20/3.25  % Parsed axioms                        : 121
% 19.20/3.25  % Removed by relevancy pruning/SinE    : 0
% 19.20/3.25  % Initial clauses                      : 121
% 19.20/3.25  % Removed in clause preprocessing      : 15
% 19.20/3.25  % Initial clauses in saturation        : 106
% 19.20/3.25  % Processed clauses                    : 18532
% 19.20/3.25  % ...of these trivial                  : 275
% 19.20/3.25  % ...subsumed                          : 15653
% 19.20/3.25  % ...remaining for further processing  : 2604
% 19.20/3.25  % Other redundant clauses eliminated   : 17
% 19.20/3.25  % Clauses deleted for lack of memory   : 0
% 19.20/3.25  % Backward-subsumed                    : 141
% 19.20/3.25  % Backward-rewritten                   : 218
% 19.20/3.25  % Generated clauses                    : 191176
% 19.20/3.25  % ...of the previous two non-redundant : 147476
% 19.20/3.25  % ...aggressively subsumed             : 0
% 19.20/3.25  % Contextual simplify-reflections      : 17
% 19.20/3.25  % Paramodulations                      : 191032
% 19.20/3.25  % Factorizations                       : 34
% 19.20/3.25  % NegExts                              : 0
% 19.20/3.25  % Equation resolutions                 : 110
% 19.20/3.25  % Disequality decompositions           : 0
% 19.20/3.25  % Total rewrite steps                  : 136169
% 19.20/3.25  % ...of those cached                   : 133698
% 19.20/3.25  % Propositional unsat checks           : 0
% 19.20/3.25  %    Propositional check models        : 0
% 19.20/3.25  %    Propositional check unsatisfiable : 0
% 19.20/3.25  %    Propositional clauses             : 0
% 19.20/3.25  %    Propositional clauses after purity: 0
% 19.20/3.25  %    Propositional unsat core size     : 0
% 19.20/3.25  %    Propositional preprocessing time  : 0.000
% 19.20/3.25  %    Propositional encoding time       : 0.000
% 19.20/3.25  %    Propositional solver time         : 0.000
% 19.20/3.25  %    Success case prop preproc time    : 0.000
% 19.20/3.25  %    Success case prop encoding time   : 0.000
% 19.20/3.25  %    Success case prop solver time     : 0.000
% 19.20/3.25  % Current number of processed clauses  : 2139
% 19.20/3.25  %    Positive orientable unit clauses  : 126
% 19.20/3.25  %    Positive unorientable unit clauses: 4
% 19.20/3.25  %    Negative unit clauses             : 39
% 19.20/3.25  %    Non-unit-clauses                  : 1970
% 19.20/3.25  % Current number of unprocessed clauses: 126717
% 19.20/3.25  % ...number of literals in the above   : 486281
% 19.20/3.25  % Current number of archived formulas  : 0
% 19.20/3.25  % Current number of archived clauses   : 477
% 19.20/3.25  % Clause-clause subsumption calls (NU) : 643420
% 19.20/3.25  % Rec. Clause-clause subsumption calls : 442612
% 19.20/3.25  % Non-unit clause-clause subsumptions  : 13435
% 19.20/3.25  % Unit Clause-clause subsumption calls : 7692
% 19.20/3.25  % Rewrite failures with RHS unbound    : 0
% 19.20/3.25  % BW rewrite match attempts            : 789
% 19.20/3.25  % BW rewrite match successes           : 430
% 19.20/3.25  % Condensation attempts                : 0
% 19.20/3.25  % Condensation successes               : 0
% 19.20/3.25  % Termbank termtop insertions          : 5060015
% 19.20/3.25  % Search garbage collected termcells   : 193
% 19.20/3.25  
% 19.20/3.25  % -------------------------------------------------
% 19.20/3.25  % User time                : 2.584 s
% 19.20/3.25  % System time              : 0.085 s
% 19.20/3.25  % Total time               : 2.669 s
% 19.20/3.25  % Maximum resident set size: 3988 pages
% 19.20/3.25  
% 19.20/3.25  % -------------------------------------------------
% 19.20/3.25  % User time                : 13.153 s
% 19.20/3.25  % System time              : 0.525 s
% 19.20/3.25  % Total time               : 13.678 s
% 19.20/3.25  % Maximum resident set size: 4864 pages
% 19.20/3.25  % E exiting
%------------------------------------------------------------------------------