↑ Up

E---3.5.1.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cartesian_product4,axiom,
    ( ~ member(X1,cross_product(X2,X3))
    | ordered_pair(first(X1),second(X1)) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product4) ).

cnf(cartesian_product2,axiom,
    ( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
    | member(X2,X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).

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_cross_product_property8_2,negated_conjecture,
    ~ member(second(not_subclass_element(cross_product(x,y),z)),y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cross_product_property8_2) ).

cnf(prove_cross_product_property8_1,negated_conjecture,
    ~ subclass(cross_product(x,y),z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cross_product_property8_1) ).

cnf(c_0_5,plain,
    ( ~ member(X1,cross_product(X2,X3))
    | ordered_pair(first(X1),second(X1)) = X1 ),
    inference(fof_simplification,[status(thm)],[cartesian_product4]) ).

cnf(c_0_6,plain,
    ( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
    | member(X2,X4) ),
    inference(fof_simplification,[status(thm)],[cartesian_product2]) ).

cnf(c_0_7,plain,
    ( ~ member(X1,cross_product(X2,X3))
    | ordered_pair(first(X1),second(X1)) = X1 ),
    c_0_5 ).

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

cnf(c_0_9,plain,
    ( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
    | member(X2,X4) ),
    c_0_6 ).

cnf(c_0_10,plain,
    ( subclass(cross_product(X1,X2),X3)
    | ordered_pair(first(not_subclass_element(cross_product(X1,X2),X3)),second(not_subclass_element(cross_product(X1,X2),X3))) = not_subclass_element(cross_product(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ member(second(not_subclass_element(cross_product(x,y),z)),y),
    inference(fof_simplification,[status(thm)],[prove_cross_product_property8_2]) ).

cnf(c_0_12,plain,
    ( ~ member(not_subclass_element(cross_product(X1,X2),X3),cross_product(X5,X4))
    | subclass(cross_product(X1,X2),X3)
    | member(second(not_subclass_element(cross_product(X1,X2),X3)),X4) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ subclass(cross_product(x,y),z),
    inference(fof_simplification,[status(thm)],[prove_cross_product_property8_1]) ).

cnf(c_0_14,negated_conjecture,
    ~ member(second(not_subclass_element(cross_product(x,y),z)),y),
    c_0_11 ).

cnf(c_0_15,plain,
    ( subclass(cross_product(X1,X2),X3)
    | member(second(not_subclass_element(cross_product(X1,X2),X3)),X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ~ subclass(cross_product(x,y),z),
    c_0_13 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET233-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n018.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:04:59 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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.10/0.44  % Version: 3.5.1
% 0.10/0.44  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44  % Starting sh5l with 300s (1) cores
% 0.10/0.44  % new_bool_3 with pid 1023209 completed with status 0
% 0.10/0.44  % Result found by new_bool_3
% 0.10/0.44  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.10/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44  % SubtermCWHack with pid 1023215 completed with status 0
% 0.10/0.44  % Result found by SubtermCWHack
% 0.10/0.44  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44  % Search class: FGHSM-FFMF31-MFFFFFNN
% 0.10/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44  % Preprocessing time       : 0.002 s
% 0.10/0.44  
% 0.10/0.44  % Proof found!
% 0.10/0.44  % SZS status Unsatisfiable
% 0.10/0.44  % SZS output start CNFRefutation
% See solution above
% 0.10/0.44  % Parsed axioms                        : 114
% 0.10/0.44  % Removed by relevancy pruning/SinE    : 89
% 0.10/0.44  % Initial clauses                      : 25
% 0.10/0.44  % Removed in clause preprocessing      : 0
% 0.10/0.44  % Initial clauses in saturation        : 25
% 0.10/0.44  % Processed clauses                    : 128
% 0.10/0.44  % ...of these trivial                  : 2
% 0.10/0.44  % ...subsumed                          : 47
% 0.10/0.44  % ...remaining for further processing  : 79
% 0.10/0.44  % Other redundant clauses eliminated   : 2
% 0.10/0.44  % Clauses deleted for lack of memory   : 0
% 0.10/0.44  % Backward-subsumed                    : 0
% 0.10/0.44  % Backward-rewritten                   : 0
% 0.10/0.44  % Generated clauses                    : 345
% 0.10/0.44  % ...of the previous two non-redundant : 328
% 0.10/0.44  % ...aggressively subsumed             : 0
% 0.10/0.44  % Contextual simplify-reflections      : 0
% 0.10/0.44  % Paramodulations                      : 343
% 0.10/0.44  % Factorizations                       : 0
% 0.10/0.44  % NegExts                              : 0
% 0.10/0.44  % Equation resolutions                 : 2
% 0.10/0.44  % Disequality decompositions           : 0
% 0.10/0.44  % Total rewrite steps                  : 10
% 0.10/0.44  % ...of those cached                   : 3
% 0.10/0.44  % Propositional unsat checks           : 0
% 0.10/0.44  %    Propositional check models        : 0
% 0.10/0.44  %    Propositional check unsatisfiable : 0
% 0.10/0.44  %    Propositional clauses             : 0
% 0.10/0.44  %    Propositional clauses after purity: 0
% 0.10/0.44  %    Propositional unsat core size     : 0
% 0.10/0.44  %    Propositional preprocessing time  : 0.000
% 0.10/0.44  %    Propositional encoding time       : 0.000
% 0.10/0.44  %    Propositional solver time         : 0.000
% 0.10/0.44  %    Success case prop preproc time    : 0.000
% 0.10/0.44  %    Success case prop encoding time   : 0.000
% 0.10/0.44  %    Success case prop solver time     : 0.000
% 0.10/0.44  % Current number of processed clauses  : 77
% 0.10/0.44  %    Positive orientable unit clauses  : 10
% 0.10/0.44  %    Positive unorientable unit clauses: 3
% 0.10/0.44  %    Negative unit clauses             : 2
% 0.10/0.44  %    Non-unit-clauses                  : 62
% 0.10/0.44  % Current number of unprocessed clauses: 207
% 0.10/0.44  % ...number of literals in the above   : 848
% 0.10/0.44  % Current number of archived formulas  : 0
% 0.10/0.44  % Current number of archived clauses   : 0
% 0.10/0.44  % Clause-clause subsumption calls (NU) : 789
% 0.10/0.44  % Rec. Clause-clause subsumption calls : 611
% 0.10/0.44  % Non-unit clause-clause subsumptions  : 47
% 0.10/0.44  % Unit Clause-clause subsumption calls : 0
% 0.10/0.44  % Rewrite failures with RHS unbound    : 0
% 0.10/0.44  % BW rewrite match attempts            : 3
% 0.10/0.44  % BW rewrite match successes           : 0
% 0.10/0.44  % Condensation attempts                : 0
% 0.10/0.44  % Condensation successes               : 0
% 0.10/0.44  % Termbank termtop insertions          : 8096
% 0.10/0.44  % Search garbage collected termcells   : 438
% 0.10/0.44  
% 0.10/0.44  % -------------------------------------------------
% 0.10/0.44  % User time                : 0.014 s
% 0.10/0.44  % System time              : 0.002 s
% 0.10/0.44  % Total time               : 0.017 s
% 0.10/0.44  % Maximum resident set size: 3744 pages
% 0.10/0.44  
% 0.10/0.44  % -------------------------------------------------
% 0.10/0.44  % User time                : 0.018 s
% 0.10/0.44  % System time              : 0.007 s
% 0.10/0.44  % Total time               : 0.025 s
% 0.10/0.44  % Maximum resident set size: 4864 pages
% 0.10/0.44  % E exiting
%------------------------------------------------------------------------------