↑ Up

E---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.13s 0.60s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (  12 unt;   0 nHn;  17 RR)
%            Number of literals    :   32 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   3 sgn)

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

cnf(class_elements_are_sets,axiom,
    subclass(X1,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(prove_corollary_to_X_product_property1_3,negated_conjecture,
    ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_X_product_property1_3) ).

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

cnf(prove_corollary_to_X_product_property1_2,negated_conjecture,
    member(v,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_X_product_property1_2) ).

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

cnf(c_0_6,plain,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    inference(fof_simplification,[status(thm)],[subclass_members]) ).

cnf(c_0_7,plain,
    ( ~ member(X3,X1)
    | ~ subclass(X1,X2)
    | member(X3,X2) ),
    c_0_6 ).

cnf(c_0_8,axiom,
    subclass(X1,universal_class),
    class_elements_are_sets ).

cnf(c_0_9,negated_conjecture,
    ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    inference(fof_simplification,[status(thm)],[prove_corollary_to_X_product_property1_3]) ).

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

cnf(c_0_11,plain,
    ( ~ member(X1,X2)
    | member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    member(v,y),
    prove_corollary_to_X_product_property1_2 ).

cnf(c_0_13,negated_conjecture,
    member(u,x),
    prove_corollary_to_X_product_property1_1 ).

cnf(c_0_14,negated_conjecture,
    ~ member(ordered_pair(u,v),cross_product(universal_class,universal_class)),
    c_0_9 ).

cnf(c_0_15,plain,
    ( ~ member(X3,X4)
    | ~ member(X1,X2)
    | member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
    c_0_10 ).

cnf(c_0_16,negated_conjecture,
    member(v,universal_class),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    member(u,universal_class),
    inference(spm,[status(thm)],[c_0_11,c_0_13]) ).

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.02  % Problem  : SET203-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.52  % Computer : n026.cluster.edu
% 0.09/0.52  % Model    : x86_64 x86_64
% 0.09/0.52  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52  % Memory   : 8046.5625MB
% 0.09/0.52  % OS       : Linux 6.8.0-71-generic
% 0.09/0.52  % CPULimit : 300
% 0.09/0.53  % WCLimit  : 300
% 0.09/0.53  % DateTime : Mon Sep 21 05:03:24 UTC 2026
% 0.09/0.53  % CPUTime  : 
% 0.09/0.53  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.57  Running first-order theorem proving
% 0.13/0.57  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.13/0.60  % Version: 3.5.1
% 0.13/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.60  % Starting sh5l with 300s (1) cores
% 0.13/0.60  % new_bool_1 with pid 1427244 completed with status 0
% 0.13/0.60  % Result found by new_bool_1
% 0.13/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.60  % Search class: FHUSF-FFSF22-SFFFFFNN
% 0.13/0.60  % partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.13/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.60  % SubtermCWHack with pid 1427246 completed with status 0
% 0.13/0.60  % Result found by SubtermCWHack
% 0.13/0.60  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.60  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.60  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.60  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.60  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.60  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.60  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.60  % Search class: FHUSF-FFSF22-SFFFFFNN
% 0.13/0.60  % partial match(1): FHUSM-FFSF22-SFFFFFNN
% 0.13/0.60  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.60  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.60  % Preprocessing time       : 0.002 s
% 0.13/0.60  
% 0.13/0.60  % Proof found!
% 0.13/0.60  % SZS status Unsatisfiable
% 0.13/0.60  % SZS output start CNFRefutation
% See solution above
% 0.13/0.60  % Parsed axioms                        : 115
% 0.13/0.60  % Removed by relevancy pruning/SinE    : 104
% 0.13/0.60  % Initial clauses                      : 11
% 0.13/0.60  % Removed in clause preprocessing      : 0
% 0.13/0.60  % Initial clauses in saturation        : 11
% 0.13/0.60  % Processed clauses                    : 15
% 0.13/0.60  % ...of these trivial                  : 0
% 0.13/0.60  % ...subsumed                          : 0
% 0.13/0.60  % ...remaining for further processing  : 14
% 0.13/0.60  % Other redundant clauses eliminated   : 2
% 0.13/0.60  % Clauses deleted for lack of memory   : 0
% 0.13/0.60  % Backward-subsumed                    : 0
% 0.13/0.60  % Backward-rewritten                   : 0
% 0.13/0.60  % Generated clauses                    : 11
% 0.13/0.60  % ...of the previous two non-redundant : 7
% 0.13/0.60  % ...aggressively subsumed             : 0
% 0.13/0.60  % Contextual simplify-reflections      : 0
% 0.13/0.60  % Paramodulations                      : 9
% 0.13/0.60  % Factorizations                       : 0
% 0.13/0.60  % NegExts                              : 0
% 0.13/0.60  % Equation resolutions                 : 2
% 0.13/0.60  % Disequality decompositions           : 0
% 0.13/0.60  % Total rewrite steps                  : 5
% 0.13/0.60  % ...of those cached                   : 2
% 0.13/0.60  % Propositional unsat checks           : 0
% 0.13/0.60  %    Propositional check models        : 0
% 0.13/0.60  %    Propositional check unsatisfiable : 0
% 0.13/0.60  %    Propositional clauses             : 0
% 0.13/0.60  %    Propositional clauses after purity: 0
% 0.13/0.60  %    Propositional unsat core size     : 0
% 0.13/0.60  %    Propositional preprocessing time  : 0.000
% 0.13/0.60  %    Propositional encoding time       : 0.000
% 0.13/0.60  %    Propositional solver time         : 0.000
% 0.13/0.60  %    Success case prop preproc time    : 0.000
% 0.13/0.60  %    Success case prop encoding time   : 0.000
% 0.13/0.60  %    Success case prop solver time     : 0.000
% 0.13/0.60  % Current number of processed clauses  : 12
% 0.13/0.60  %    Positive orientable unit clauses  : 6
% 0.13/0.60  %    Positive unorientable unit clauses: 0
% 0.13/0.60  %    Negative unit clauses             : 1
% 0.13/0.60  %    Non-unit-clauses                  : 5
% 0.13/0.60  % Current number of unprocessed clauses: 3
% 0.13/0.60  % ...number of literals in the above   : 7
% 0.13/0.60  % Current number of archived formulas  : 0
% 0.13/0.60  % Current number of archived clauses   : 0
% 0.13/0.60  % Clause-clause subsumption calls (NU) : 0
% 0.13/0.60  % Rec. Clause-clause subsumption calls : 0
% 0.13/0.60  % Non-unit clause-clause subsumptions  : 0
% 0.13/0.60  % Unit Clause-clause subsumption calls : 0
% 0.13/0.60  % Rewrite failures with RHS unbound    : 0
% 0.13/0.60  % BW rewrite match attempts            : 1
% 0.13/0.60  % BW rewrite match successes           : 0
% 0.13/0.60  % Condensation attempts                : 0
% 0.13/0.60  % Condensation successes               : 0
% 0.13/0.60  % Termbank termtop insertions          : 1204
% 0.13/0.60  % Search garbage collected termcells   : 500
% 0.13/0.60  
% 0.13/0.60  % -------------------------------------------------
% 0.13/0.60  % User time                : 0.004 s
% 0.13/0.60  % System time              : 0.001 s
% 0.13/0.60  % Total time               : 0.005 s
% 0.13/0.60  % Maximum resident set size: 3744 pages
% 0.13/0.60  
% 0.13/0.60  % -------------------------------------------------
% 0.13/0.60  % User time                : 0.008 s
% 0.13/0.60  % System time              : 0.005 s
% 0.13/0.60  % Total time               : 0.013 s
% 0.13/0.60  % Maximum resident set size: 4608 pages
% 0.13/0.60  % E exiting
%------------------------------------------------------------------------------