↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP153^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.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 : Wed Sep 30 08:04:31 AM UTC 2026

% Result   : Theorem 0.20s 0.36s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   69 (   7   ~;   4   |;   3   &;  54   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    5 (   4 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^;   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    set_Product_prod_a_a: $tType ).

thf(decl_sort2,type,
    a: $tType ).

thf(decl_sort3,type,
    set_a: $tType ).

thf(decl_sort4,type,
    product_prod_a_a: $tType ).

thf(decl_70,type,
    product_Pair_a_a: a > a > product_prod_a_a ).

thf(decl_101,type,
    member449909584od_a_a: product_prod_a_a > set_Product_prod_a_a > $o ).

thf(decl_103,type,
    member_a: a > set_a > $o ).

thf(decl_104,type,
    carrier: set_a ).

thf(decl_105,type,
    relation: set_Product_prod_a_a ).

thf(decl_106,type,
    y: a ).

thf(decl_107,type,
    z: a ).

thf(conj_0,conjecture,
    ( ( member_a @ z @ carrier )
    & ( member_a @ y @ carrier ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6rMxIxBlgv/E---3.1_3856452.p',conj_0) ).

thf(fact_8_not__outside,axiom,
    ! [X3: a,X4: a] :
      ( ( member449909584od_a_a @ ( product_Pair_a_a @ X3 @ X4 ) @ relation )
     => ( member_a @ X3 @ carrier ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6rMxIxBlgv/E---3.1_3856452.p',fact_8_not__outside) ).

thf(fact_0_assms,axiom,
    ( ( member449909584od_a_a @ ( product_Pair_a_a @ z @ y ) @ relation )
    & ( member449909584od_a_a @ ( product_Pair_a_a @ y @ z ) @ relation ) ),
    file('/export/starexec/sandbox2/tmp/tmp.6rMxIxBlgv/E---3.1_3856452.p',fact_0_assms) ).

thf(c_0_3,negated_conjecture,
    ~ ( ( member_a @ z @ carrier )
      & ( member_a @ y @ carrier ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,plain,
    ! [X1279: a,X1280: a] :
      ( ~ ( member449909584od_a_a @ ( product_Pair_a_a @ X1279 @ X1280 ) @ relation )
      | ( member_a @ X1279 @ carrier ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_not__outside])])]) ).

thf(c_0_5,negated_conjecture,
    ( ~ ( member_a @ z @ carrier )
    | ~ ( member_a @ y @ carrier ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

thf(c_0_6,plain,
    ! [X1: a,X2: a] :
      ( ( member_a @ X1 @ carrier )
      | ~ ( member449909584od_a_a @ ( product_Pair_a_a @ X1 @ X2 ) @ relation ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,plain,
    member449909584od_a_a @ ( product_Pair_a_a @ z @ y ) @ relation,
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_8,plain,
    member449909584od_a_a @ ( product_Pair_a_a @ y @ z ) @ relation,
    inference(split_conjunct,[status(thm)],[fact_0_assms]) ).

thf(c_0_9,negated_conjecture,
    ( ~ ( member_a @ z @ carrier )
    | ~ ( member_a @ y @ carrier ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_10,plain,
    member_a @ z @ carrier,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_11,plain,
    member_a @ y @ carrier,
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

thf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP153^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n007.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Tue Sep 29 20:00:26 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.20/0.29  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.6rMxIxBlgv/E---3.1_3856452.p
% 0.20/0.36  % Version: 3.5.1-ho
% 0.20/0.36  % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.20/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36  % Starting full_lambda_5 with 1500s (5) cores
% 0.20/0.36  % Starting new_ho_12 with 300s (1) cores
% 0.20/0.36  % Starting pre_casc_5 with 300s (1) cores
% 0.20/0.36  % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.36  % full_lambda_9 with pid 3856468 completed with status 0
% 0.20/0.36  % Result found by full_lambda_9
% 0.20/0.36  % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.20/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36  % Starting full_lambda_5 with 1500s (5) cores
% 0.20/0.36  % Starting new_ho_12 with 300s (1) cores
% 0.20/0.36  % Starting pre_casc_5 with 300s (1) cores
% 0.20/0.36  % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.36  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.20/0.36  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.20/0.36  % Search class: HGHSM-FSLM31-DHFFFFBN
% 0.20/0.36  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.36  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.36  % SubtermCWHack with pid 3856470 completed with status 0
% 0.20/0.36  % Result found by SubtermCWHack
% 0.20/0.36  % Preprocessing class: HSLSSMSMSSMCHFA.
% 0.20/0.36  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.36  % Starting full_lambda_5 with 1500s (5) cores
% 0.20/0.36  % Starting new_ho_12 with 300s (1) cores
% 0.20/0.36  % Starting pre_casc_5 with 300s (1) cores
% 0.20/0.36  % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.36  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.20/0.36  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.20/0.36  % Search class: HGHSM-FSLM31-DHFFFFBN
% 0.20/0.36  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.36  % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.36  % Preprocessing time       : 0.006 s
% 0.20/0.36  
% 0.20/0.36  % Proof found!
% 0.20/0.36  % SZS status Theorem
% 0.20/0.36  % SZS output start CNFRefutation
% See solution above
% 0.20/0.36  % Parsed axioms                        : 452
% 0.20/0.36  % Removed by relevancy pruning/SinE    : 257
% 0.20/0.36  % Initial clauses                      : 300
% 0.20/0.36  % Removed in clause preprocessing      : 21
% 0.20/0.36  % Initial clauses in saturation        : 279
% 0.20/0.36  % Processed clauses                    : 125
% 0.20/0.36  % ...of these trivial                  : 3
% 0.20/0.36  % ...subsumed                          : 27
% 0.20/0.36  % ...remaining for further processing  : 94
% 0.20/0.36  % Other redundant clauses eliminated   : 23
% 0.20/0.36  % Clauses deleted for lack of memory   : 0
% 0.20/0.36  % Backward-subsumed                    : 1
% 0.20/0.36  % Backward-rewritten                   : 3
% 0.20/0.36  % Generated clauses                    : 81
% 0.20/0.36  % ...of the previous two non-redundant : 43
% 0.20/0.36  % ...aggressively subsumed             : 0
% 0.20/0.36  % Contextual simplify-reflections      : 0
% 0.20/0.36  % Paramodulations                      : 49
% 0.20/0.36  % Factorizations                       : 0
% 0.20/0.36  % NegExts                              : 0
% 0.20/0.36  % Equation resolutions                 : 25
% 0.20/0.36  % Disequality decompositions           : 0
% 0.20/0.36  % Total rewrite steps                  : 36
% 0.20/0.36  % ...of those cached                   : 21
% 0.20/0.36  % Propositional unsat checks           : 0
% 0.20/0.36  %    Propositional check models        : 0
% 0.20/0.36  %    Propositional check unsatisfiable : 0
% 0.20/0.36  %    Propositional clauses             : 0
% 0.20/0.36  %    Propositional clauses after purity: 0
% 0.20/0.36  %    Propositional unsat core size     : 0
% 0.20/0.36  %    Propositional preprocessing time  : 0.000
% 0.20/0.36  %    Propositional encoding time       : 0.000
% 0.20/0.36  %    Propositional solver time         : 0.000
% 0.20/0.36  %    Success case prop preproc time    : 0.000
% 0.20/0.36  %    Success case prop encoding time   : 0.000
% 0.20/0.36  %    Success case prop solver time     : 0.000
% 0.20/0.36  % Current number of processed clauses  : 67
% 0.20/0.36  %    Positive orientable unit clauses  : 33
% 0.20/0.36  %    Positive unorientable unit clauses: 0
% 0.20/0.36  %    Negative unit clauses             : 3
% 0.20/0.36  %    Non-unit-clauses                  : 31
% 0.20/0.36  % Current number of unprocessed clauses: 197
% 0.20/0.36  % ...number of literals in the above   : 675
% 0.20/0.36  % Current number of archived formulas  : 0
% 0.20/0.36  % Current number of archived clauses   : 6
% 0.20/0.36  % Clause-clause subsumption calls (NU) : 176
% 0.20/0.36  % Rec. Clause-clause subsumption calls : 169
% 0.20/0.36  % Non-unit clause-clause subsumptions  : 14
% 0.20/0.36  % Unit Clause-clause subsumption calls : 15
% 0.20/0.36  % Rewrite failures with RHS unbound    : 0
% 0.20/0.36  % BW rewrite match attempts            : 5
% 0.20/0.36  % BW rewrite match successes           : 3
% 0.20/0.36  % Condensation attempts                : 0
% 0.20/0.36  % Condensation successes               : 0
% 0.20/0.36  % Termbank termtop insertions          : 29702
% 0.20/0.36  % Search garbage collected termcells   : 9090
% 0.20/0.36  
% 0.20/0.36  % -------------------------------------------------
% 0.20/0.36  % User time                : 0.029 s
% 0.20/0.36  % System time              : 0.007 s
% 0.20/0.36  % Total time               : 0.036 s
% 0.20/0.36  % Maximum resident set size: 5948 pages
% 0.20/0.36  
% 0.20/0.36  % -------------------------------------------------
% 0.20/0.36  % User time                : 0.046 s
% 0.20/0.36  % System time              : 0.011 s
% 0.20/0.36  % Total time               : 0.058 s
% 0.20/0.36  % Maximum resident set size: 5888 pages
% 0.20/0.36  % E exiting
%------------------------------------------------------------------------------