↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET076-7 : 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 : n012.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:27 PM UTC 2026

% Result   : Unsatisfiable 13.45s 2.12s
% Output   : CNFRefutation 13.45s
% 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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_unordered_pair_is_subset_3) ).

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

cnf(prove_unordered_pair_is_subset_2,negated_conjecture,
    member(y,z),
    file('/export/starexec/sandbox/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.01  % Problem  : SET076-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Mon Sep 21 04:49:53 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.03/0.30  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32  Running first-order theorem proving
% 0.07/0.32  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
% 13.45/2.12  % Version: 3.5.1
% 13.45/2.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.45/2.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.45/2.12  % Starting new_bool_3 with 300s (1) cores
% 13.45/2.12  % Starting new_bool_1 with 300s (1) cores
% 13.45/2.12  % Starting sh5l with 300s (1) cores
% 13.45/2.12  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1592129 completed with status 0
% 13.45/2.12  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 13.45/2.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.45/2.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.45/2.12  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.45/2.12  % No SInE strategy applied
% 13.45/2.12  % Search class: FGHSM-FFLM31-DFFFFFNN
% 13.45/2.12  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.45/2.12  % Starting SubtermCWHack with 136s (1) cores
% 13.45/2.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.45/2.12  % Starting new_bool_3 with 311s (1) cores
% 13.45/2.12  % Starting new_bool_1 with 308s (1) cores
% 13.45/2.12  % Starting sh5l with 304s (1) cores
% 13.45/2.12  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1592137 completed with status 0
% 13.45/2.12  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 13.45/2.12  % Preprocessing class: FSLSSMSMSSSNFFN.
% 13.45/2.12  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.45/2.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 13.45/2.12  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.45/2.12  % No SInE strategy applied
% 13.45/2.12  % Search class: FGHSM-FFLM31-DFFFFFNN
% 13.45/2.12  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.45/2.12  % Starting SubtermCWHack with 136s (1) cores
% 13.45/2.12  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 13.45/2.12  % Preprocessing time       : 0.002 s
% 13.45/2.12  % Presaturation interreduction done
% 13.45/2.12  
% 13.45/2.12  % Proof found!
% 13.45/2.12  % SZS status Unsatisfiable
% 13.45/2.12  % SZS output start CNFRefutation
% See solution above
% 13.45/2.12  % Parsed axioms                        : 121
% 13.45/2.12  % Removed by relevancy pruning/SinE    : 0
% 13.45/2.12  % Initial clauses                      : 121
% 13.45/2.12  % Removed in clause preprocessing      : 15
% 13.45/2.12  % Initial clauses in saturation        : 106
% 13.45/2.12  % Processed clauses                    : 14925
% 13.45/2.12  % ...of these trivial                  : 237
% 13.45/2.12  % ...subsumed                          : 12429
% 13.45/2.12  % ...remaining for further processing  : 2259
% 13.45/2.12  % Other redundant clauses eliminated   : 17
% 13.45/2.12  % Clauses deleted for lack of memory   : 0
% 13.45/2.12  % Backward-subsumed                    : 125
% 13.45/2.12  % Backward-rewritten                   : 185
% 13.45/2.12  % Generated clauses                    : 144732
% 13.45/2.12  % ...of the previous two non-redundant : 109781
% 13.45/2.12  % ...aggressively subsumed             : 0
% 13.45/2.12  % Contextual simplify-reflections      : 14
% 13.45/2.12  % Paramodulations                      : 144589
% 13.45/2.12  % Factorizations                       : 34
% 13.45/2.12  % NegExts                              : 0
% 13.45/2.12  % Equation resolutions                 : 109
% 13.45/2.12  % Disequality decompositions           : 0
% 13.45/2.12  % Total rewrite steps                  : 106688
% 13.45/2.12  % ...of those cached                   : 104859
% 13.45/2.12  % Propositional unsat checks           : 0
% 13.45/2.12  %    Propositional check models        : 0
% 13.45/2.12  %    Propositional check unsatisfiable : 0
% 13.45/2.12  %    Propositional clauses             : 0
% 13.45/2.12  %    Propositional clauses after purity: 0
% 13.45/2.12  %    Propositional unsat core size     : 0
% 13.45/2.12  %    Propositional preprocessing time  : 0.000
% 13.45/2.12  %    Propositional encoding time       : 0.000
% 13.45/2.12  %    Propositional solver time         : 0.000
% 13.45/2.12  %    Success case prop preproc time    : 0.000
% 13.45/2.12  %    Success case prop encoding time   : 0.000
% 13.45/2.12  %    Success case prop solver time     : 0.000
% 13.45/2.12  % Current number of processed clauses  : 1843
% 13.45/2.12  %    Positive orientable unit clauses  : 119
% 13.45/2.12  %    Positive unorientable unit clauses: 4
% 13.45/2.12  %    Negative unit clauses             : 38
% 13.45/2.12  %    Non-unit-clauses                  : 1682
% 13.45/2.12  % Current number of unprocessed clauses: 93153
% 13.45/2.12  % ...number of literals in the above   : 352238
% 13.45/2.12  % Current number of archived formulas  : 0
% 13.45/2.12  % Current number of archived clauses   : 428
% 13.45/2.12  % Clause-clause subsumption calls (NU) : 500150
% 13.45/2.12  % Rec. Clause-clause subsumption calls : 333718
% 13.45/2.12  % Non-unit clause-clause subsumptions  : 10580
% 13.45/2.12  % Unit Clause-clause subsumption calls : 4817
% 13.45/2.12  % Rewrite failures with RHS unbound    : 0
% 13.45/2.12  % BW rewrite match attempts            : 435
% 13.45/2.12  % BW rewrite match successes           : 76
% 13.45/2.12  % Condensation attempts                : 0
% 13.45/2.12  % Condensation successes               : 0
% 13.45/2.12  % Termbank termtop insertions          : 4045697
% 13.45/2.12  % Search garbage collected termcells   : 193
% 13.45/2.12  
% 13.45/2.12  % -------------------------------------------------
% 13.45/2.12  % User time                : 1.691 s
% 13.45/2.12  % System time              : 0.053 s
% 13.45/2.12  % Total time               : 1.745 s
% 13.45/2.12  % Maximum resident set size: 3988 pages
% 13.45/2.12  
% 13.45/2.12  % -------------------------------------------------
% 13.45/2.12  % User time                : 8.439 s
% 13.45/2.12  % System time              : 0.344 s
% 13.45/2.12  % Total time               : 8.783 s
% 13.45/2.12  % Maximum resident set size: 4864 pages
% 13.45/2.12  % E exiting
%------------------------------------------------------------------------------