↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Computer : n003.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:05:40 AM UTC 2026

% Result   : Theorem 0.30s 0.38s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   0 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  110 (  10   ~;  11   |;   1   &;  86   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 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   :    7 (   0   ^;   7   !;   0   ?;   7   :)

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

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

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

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

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

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

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

thf(decl_169,type,
    carrier: set_a ).

thf(decl_170,type,
    relation: set_Product_prod_a_a ).

thf(decl_171,type,
    x: a ).

thf(decl_172,type,
    y: a ).

thf(fact_3_compl,axiom,
    ! [X4: a] :
      ( ( member_a @ X4 @ carrier )
     => ! [X5: a] :
          ( ( member_a @ X5 @ carrier )
         => ( ( member449909584od_a_a @ ( product_Pair_a_a @ X4 @ X5 ) @ relation )
            | ( member449909584od_a_a @ ( product_Pair_a_a @ X5 @ X4 ) @ relation ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.AXC28f5crO/E---3.1_2988097.p',fact_3_compl) ).

thf(conj_3,conjecture,
    ( ( member449909584od_a_a @ ( product_Pair_a_a @ x @ y ) @ relation )
    | ( member449909584od_a_a @ ( product_Pair_a_a @ y @ x ) @ relation ) ),
    file('/export/starexec/sandbox/tmp/tmp.AXC28f5crO/E---3.1_2988097.p',conj_3) ).

thf(conj_1,hypothesis,
    member_a @ y @ carrier,
    file('/export/starexec/sandbox/tmp/tmp.AXC28f5crO/E---3.1_2988097.p',conj_1) ).

thf(conj_0,hypothesis,
    member_a @ x @ carrier,
    file('/export/starexec/sandbox/tmp/tmp.AXC28f5crO/E---3.1_2988097.p',conj_0) ).

thf(c_0_4,plain,
    ! [X1084: a,X1085: a] :
      ( ~ ( member_a @ X1084 @ carrier )
      | ~ ( member_a @ X1085 @ carrier )
      | ( member449909584od_a_a @ ( product_Pair_a_a @ X1084 @ X1085 ) @ relation )
      | ( member449909584od_a_a @ ( product_Pair_a_a @ X1085 @ X1084 ) @ relation ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_compl])])])]) ).

thf(c_0_5,negated_conjecture,
    ~ ( ( member449909584od_a_a @ ( product_Pair_a_a @ x @ y ) @ relation )
      | ( member449909584od_a_a @ ( product_Pair_a_a @ y @ x ) @ relation ) ),
    inference(assume_negation,[status(cth)],[conj_3]) ).

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

thf(c_0_7,hypothesis,
    member_a @ y @ carrier,
    inference(split_conjunct,[status(thm)],[conj_1]) ).

thf(c_0_8,negated_conjecture,
    ( ~ ( member449909584od_a_a @ ( product_Pair_a_a @ x @ y ) @ relation )
    & ~ ( member449909584od_a_a @ ( product_Pair_a_a @ y @ x ) @ relation ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

thf(c_0_9,hypothesis,
    ! [X1: a] :
      ( ( member449909584od_a_a @ ( product_Pair_a_a @ y @ X1 ) @ relation )
      | ( member449909584od_a_a @ ( product_Pair_a_a @ X1 @ y ) @ relation )
      | ~ ( member_a @ X1 @ carrier ) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,hypothesis,
    member_a @ x @ carrier,
    inference(split_conjunct,[status(thm)],[conj_0]) ).

thf(c_0_11,negated_conjecture,
    ~ ( member449909584od_a_a @ ( product_Pair_a_a @ y @ x ) @ relation ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ~ ( member449909584od_a_a @ ( product_Pair_a_a @ x @ y ) @ relation ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_13,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP152^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n003.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 20:03:59 UTC 2026
% 0.07/0.20  % CPUTime  : 
% 0.07/0.20  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 0.23/0.31  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.AXC28f5crO/E---3.1_2988097.p
% 0.30/0.38  % Version: 3.5.1-ho
% 0.30/0.38  % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.30/0.38  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.38  % Starting full_lambda_6 with 1200s (4) cores
% 0.30/0.38  % Starting additional_ho_6 with 300s (1) cores
% 0.30/0.38  % Starting new_ho_9 with 300s (1) cores
% 0.30/0.38  % Starting full_lambda_3 with 300s (1) cores
% 0.30/0.38  % Starting post_as_ho6 with 300s (1) cores
% 0.30/0.38  % post_as_ho6 with pid 2988114 completed with status 0
% 0.30/0.38  % Result found by post_as_ho6
% 0.30/0.38  % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.30/0.38  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.38  % Starting full_lambda_6 with 1200s (4) cores
% 0.30/0.38  % Starting additional_ho_6 with 300s (1) cores
% 0.30/0.38  % Starting new_ho_9 with 300s (1) cores
% 0.30/0.38  % Starting full_lambda_3 with 300s (1) cores
% 0.30/0.38  % Starting post_as_ho6 with 300s (1) cores
% 0.30/0.38  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.30/0.38  % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.30/0.38  % Search class: HGUSS-FFMS21-SHFFFFBN
% 0.30/0.38  % partial match(2): HGHSS-FFMM21-SHFFFFBN
% 0.30/0.38  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.38  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.38  % SubtermCWHack with pid 2988116 completed with status 0
% 0.30/0.38  % Result found by SubtermCWHack
% 0.30/0.38  % Preprocessing class: HSLMSMSMSSMNHFA.
% 0.30/0.38  % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.38  % Starting full_lambda_6 with 1200s (4) cores
% 0.30/0.38  % Starting additional_ho_6 with 300s (1) cores
% 0.30/0.38  % Starting new_ho_9 with 300s (1) cores
% 0.30/0.38  % Starting full_lambda_3 with 300s (1) cores
% 0.30/0.38  % Starting post_as_ho6 with 300s (1) cores
% 0.30/0.38  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true))
% 0.30/0.38  % SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
% 0.30/0.38  % Search class: HGUSS-FFMS21-SHFFFFBN
% 0.30/0.38  % partial match(2): HGHSS-FFMM21-SHFFFFBN
% 0.30/0.38  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.38  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.38  % Preprocessing time       : 0.002 s
% 0.30/0.38  
% 0.30/0.38  % Proof found!
% 0.30/0.38  % SZS status Theorem
% 0.30/0.38  % SZS output start CNFRefutation
% See solution above
% 0.30/0.38  % Parsed axioms                        : 531
% 0.30/0.38  % Removed by relevancy pruning/SinE    : 505
% 0.30/0.38  % Initial clauses                      : 42
% 0.30/0.38  % Removed in clause preprocessing      : 5
% 0.30/0.38  % Initial clauses in saturation        : 37
% 0.30/0.38  % Processed clauses                    : 53
% 0.30/0.38  % ...of these trivial                  : 5
% 0.30/0.38  % ...subsumed                          : 14
% 0.30/0.38  % ...remaining for further processing  : 34
% 0.30/0.38  % Other redundant clauses eliminated   : 10
% 0.30/0.38  % Clauses deleted for lack of memory   : 0
% 0.30/0.38  % Backward-subsumed                    : 0
% 0.30/0.38  % Backward-rewritten                   : 5
% 0.30/0.38  % Generated clauses                    : 53
% 0.30/0.38  % ...of the previous two non-redundant : 35
% 0.30/0.38  % ...aggressively subsumed             : 0
% 0.30/0.38  % Contextual simplify-reflections      : 0
% 0.30/0.38  % Paramodulations                      : 41
% 0.30/0.38  % Factorizations                       : 0
% 0.30/0.38  % NegExts                              : 0
% 0.30/0.38  % Equation resolutions                 : 12
% 0.30/0.38  % Disequality decompositions           : 0
% 0.30/0.38  % Total rewrite steps                  : 24
% 0.30/0.38  % ...of those cached                   : 11
% 0.30/0.38  % Propositional unsat checks           : 0
% 0.30/0.38  %    Propositional check models        : 0
% 0.30/0.38  %    Propositional check unsatisfiable : 0
% 0.30/0.38  %    Propositional clauses             : 0
% 0.30/0.38  %    Propositional clauses after purity: 0
% 0.30/0.38  %    Propositional unsat core size     : 0
% 0.30/0.38  %    Propositional preprocessing time  : 0.000
% 0.30/0.38  %    Propositional encoding time       : 0.000
% 0.30/0.38  %    Propositional solver time         : 0.000
% 0.30/0.38  %    Success case prop preproc time    : 0.000
% 0.30/0.38  %    Success case prop encoding time   : 0.000
% 0.30/0.38  %    Success case prop solver time     : 0.000
% 0.30/0.38  % Current number of processed clauses  : 29
% 0.30/0.38  %    Positive orientable unit clauses  : 9
% 0.30/0.38  %    Positive unorientable unit clauses: 0
% 0.30/0.38  %    Negative unit clauses             : 3
% 0.30/0.38  %    Non-unit-clauses                  : 17
% 0.30/0.38  % Current number of unprocessed clauses: 12
% 0.30/0.38  % ...number of literals in the above   : 55
% 0.30/0.38  % Current number of archived formulas  : 0
% 0.30/0.38  % Current number of archived clauses   : 5
% 0.30/0.38  % Clause-clause subsumption calls (NU) : 72
% 0.30/0.38  % Rec. Clause-clause subsumption calls : 63
% 0.30/0.38  % Non-unit clause-clause subsumptions  : 14
% 0.30/0.38  % Unit Clause-clause subsumption calls : 18
% 0.30/0.38  % Rewrite failures with RHS unbound    : 0
% 0.30/0.38  % BW rewrite match attempts            : 4
% 0.30/0.38  % BW rewrite match successes           : 4
% 0.30/0.38  % Condensation attempts                : 0
% 0.30/0.38  % Condensation successes               : 0
% 0.30/0.38  % Termbank termtop insertions          : 10467
% 0.30/0.38  % Search garbage collected termcells   : 5338
% 0.30/0.38  
% 0.30/0.38  % -------------------------------------------------
% 0.30/0.38  % User time                : 0.007 s
% 0.30/0.38  % System time              : 0.005 s
% 0.30/0.38  % Total time               : 0.013 s
% 0.30/0.38  % Maximum resident set size: 5476 pages
% 0.30/0.38  
% 0.30/0.38  % -------------------------------------------------
% 0.30/0.38  % User time                : 0.026 s
% 0.30/0.38  % System time              : 0.012 s
% 0.30/0.38  % Total time               : 0.038 s
% 0.30/0.38  % Maximum resident set size: 6144 pages
% 0.30/0.38  % E exiting
%------------------------------------------------------------------------------