↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP219^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n019.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:45 AM UTC 2026

% Result   : Theorem 3.16s 3.13s
% Output   : CNFRefutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   20 (   3 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   55 (   7   ~;   3   |;   0   &;  44   @)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (   0   ^;  15   !;   0   ?;  15   :)

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

thf(decl_25,type,
    entails: assn > assn > $o ).

thf(decl_239,type,
    sup_sup_assn: assn > assn > assn ).

thf(decl_735,type,
    bot_bot_assn: assn ).

thf(decl_1177,type,
    p: assn ).

thf(decl_1178,type,
    q: assn ).

thf(conj_0,conjecture,
    entails @ p @ q,
    file('/export/starexec/sandbox2/tmp/tmp.mlkb4z98ZD/E---3.1_1295240.p',conj_0) ).

thf(fact_3588_ent__disjI2_H,axiom,
    ! [X4: assn,X22: assn,X5: assn] :
      ( ( entails @ X4 @ X22 )
     => ( entails @ X4 @ ( sup_sup_assn @ X5 @ X22 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.mlkb4z98ZD/E---3.1_1295240.p',fact_3588_ent__disjI2_H) ).

thf(fact_2585_sup__bot_Oright__neutral,axiom,
    ! [X13: assn] :
      ( ( sup_sup_assn @ X13 @ bot_bot_assn )
      = X13 ),
    file('/export/starexec/sandbox2/tmp/tmp.mlkb4z98ZD/E---3.1_1295240.p',fact_2585_sup__bot_Oright__neutral) ).

thf(fact_1__092_060open_062P_A_092_060Longrightarrow_062_092_060_094sub_062A_Afalse_092_060close_062,axiom,
    entails @ p @ bot_bot_assn,
    file('/export/starexec/sandbox2/tmp/tmp.mlkb4z98ZD/E---3.1_1295240.p',fact_1__092_060open_062P_A_092_060Longrightarrow_062_092_060_094sub_062A_Afalse_092_060close_062) ).

thf(c_0_4,negated_conjecture,
    ~ ( entails @ p @ q ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_5,plain,
    ! [X14336: assn,X14337: assn,X14338: assn] :
      ( ~ ( entails @ X14336 @ X14337 )
      | ( entails @ X14336 @ ( sup_sup_assn @ X14338 @ X14337 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3588_ent__disjI2_H])])]) ).

thf(c_0_6,plain,
    ! [X14802: assn] :
      ( ( sup_sup_assn @ X14802 @ bot_bot_assn )
      = X14802 ),
    inference(variable_rename,[status(thm)],[fact_2585_sup__bot_Oright__neutral]) ).

thf(c_0_7,negated_conjecture,
    ~ ( entails @ p @ q ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

thf(c_0_8,plain,
    ! [X1: assn,X4: assn,X2: assn] :
      ( ( entails @ X1 @ ( sup_sup_assn @ X4 @ X2 ) )
      | ~ ( entails @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X1: assn] :
      ( ( sup_sup_assn @ X1 @ bot_bot_assn )
      = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ~ ( entails @ p @ q ),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X2: assn,X1: assn] :
      ( ( entails @ X1 @ X2 )
      | ~ ( entails @ X1 @ bot_bot_assn ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,plain,
    entails @ p @ bot_bot_assn,
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062P_A_092_060Longrightarrow_062_092_060_094sub_062A_Afalse_092_060close_062]) ).

thf(c_0_13,negated_conjecture,
    ~ ( entails @ p @ q ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,plain,
    ! [X1: assn] : ( entails @ p @ X1 ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP219^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  % Computer : n019.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Tue Sep 29 20:19:34 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24  Running higher-order theorem proving
% 2.14/2.28  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.mlkb4z98ZD/E---3.1_1295240.p
% 3.16/3.13  % Version: 3.5.1-ho
% 3.16/3.13  % partial match(2): HMLLSMLLSSLNSFA
% 3.16/3.13  % Preprocessing class: HMLLSMLMSSLNHFA.
% 3.16/3.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/3.13  % Starting new_bool_8 with 1200s (4) cores
% 3.16/3.13  % Starting post_as_ho5 with 600s (2) cores
% 3.16/3.13  % Starting new_bool_9 with 300s (1) cores
% 3.16/3.13  % Starting new_bool_3 with 300s (1) cores
% 3.16/3.13  % new_bool_8 with pid 1295254 completed with status 0
% 3.16/3.13  % Result found by new_bool_8
% 3.16/3.13  % partial match(2): HMLLSMLLSSLNSFA
% 3.16/3.13  % Preprocessing class: HMLLSMLMSSLNHFA.
% 3.16/3.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/3.13  % Starting new_bool_8 with 1200s (4) cores
% 3.16/3.13  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 3.16/3.13  % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 3.16/3.13  % Search class: HGHSM-FSLS31-MHFFFFNN
% 3.16/3.13  % partial match(2): FGHSM-FSLS31-MFFFFFNN
% 3.16/3.13  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 3.16/3.13  % Starting SubtermCWHack with 109s (1) cores
% 3.16/3.13  % Starting new_bool_8 with 121s (1) cores
% 3.16/3.13  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 195s (1) cores
% 3.16/3.13  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S06DI with 109s (1) cores
% 3.16/3.13  % SubtermCWHack with pid 1295258 completed with status 0
% 3.16/3.13  % Result found by SubtermCWHack
% 3.16/3.13  % partial match(2): HMLLSMLLSSLNSFA
% 3.16/3.13  % Preprocessing class: HMLLSMLMSSLNHFA.
% 3.16/3.13  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/3.13  % Starting new_bool_8 with 1200s (4) cores
% 3.16/3.13  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 3.16/3.13  % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 3.16/3.13  % Search class: HGHSM-FSLS31-MHFFFFNN
% 3.16/3.13  % partial match(2): FGHSM-FSLS31-MFFFFFNN
% 3.16/3.13  % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 3.16/3.13  % Starting SubtermCWHack with 109s (1) cores
% 3.16/3.13  % Preprocessing time       : 0.009 s
% 3.16/3.13  
% 3.16/3.13  % Proof found!
% 3.16/3.13  % SZS status Theorem
% 3.16/3.13  % SZS output start CNFRefutation
% See solution above
% 3.66/3.13  % Parsed axioms                        : 7184
% 3.66/3.13  % Removed by relevancy pruning/SinE    : 6978
% 3.66/3.13  % Initial clauses                      : 252
% 3.66/3.13  % Removed in clause preprocessing      : 1
% 3.66/3.13  % Initial clauses in saturation        : 251
% 3.66/3.13  % Processed clauses                    : 131
% 3.66/3.13  % ...of these trivial                  : 27
% 3.66/3.13  % ...subsumed                          : 43
% 3.66/3.13  % ...remaining for further processing  : 61
% 3.66/3.13  % Other redundant clauses eliminated   : 17
% 3.66/3.13  % Clauses deleted for lack of memory   : 0
% 3.66/3.13  % Backward-subsumed                    : 0
% 3.66/3.13  % Backward-rewritten                   : 2
% 3.66/3.13  % Generated clauses                    : 205
% 3.66/3.13  % ...of the previous two non-redundant : 56
% 3.66/3.13  % ...aggressively subsumed             : 0
% 3.66/3.13  % Contextual simplify-reflections      : 0
% 3.66/3.13  % Paramodulations                      : 192
% 3.66/3.13  % Factorizations                       : 0
% 3.66/3.13  % NegExts                              : 0
% 3.66/3.13  % Equation resolutions                 : 17
% 3.66/3.13  % Disequality decompositions           : 0
% 3.66/3.13  % Total rewrite steps                  : 164
% 3.66/3.13  % ...of those cached                   : 125
% 3.66/3.13  % Propositional unsat checks           : 0
% 3.66/3.13  %    Propositional check models        : 0
% 3.66/3.13  %    Propositional check unsatisfiable : 0
% 3.66/3.13  %    Propositional clauses             : 0
% 3.66/3.13  %    Propositional clauses after purity: 0
% 3.66/3.13  %    Propositional unsat core size     : 0
% 3.66/3.13  %    Propositional preprocessing time  : 0.000
% 3.66/3.13  %    Propositional encoding time       : 0.000
% 3.66/3.13  %    Propositional solver time         : 0.000
% 3.66/3.13  %    Success case prop preproc time    : 0.000
% 3.66/3.13  %    Success case prop encoding time   : 0.000
% 3.66/3.13  %    Success case prop solver time     : 0.000
% 3.66/3.13  % Current number of processed clauses  : 52
% 3.66/3.13  %    Positive orientable unit clauses  : 27
% 3.66/3.13  %    Positive unorientable unit clauses: 3
% 3.66/3.13  %    Negative unit clauses             : 5
% 3.66/3.13  %    Non-unit-clauses                  : 17
% 3.66/3.13  % Current number of unprocessed clauses: 176
% 3.66/3.13  % ...number of literals in the above   : 344
% 3.66/3.13  % Current number of archived formulas  : 0
% 3.66/3.13  % Current number of archived clauses   : 2
% 3.66/3.13  % Clause-clause subsumption calls (NU) : 65
% 3.66/3.13  % Rec. Clause-clause subsumption calls : 65
% 3.66/3.13  % Non-unit clause-clause subsumptions  : 33
% 3.66/3.13  % Unit Clause-clause subsumption calls : 21
% 3.66/3.13  % Rewrite failures with RHS unbound    : 0
% 3.66/3.13  % BW rewrite match attempts            : 38
% 3.66/3.13  % BW rewrite match successes           : 24
% 3.66/3.13  % Condensation attempts                : 0
% 3.66/3.13  % Condensation successes               : 0
% 3.66/3.13  % Termbank termtop insertions          : 113024
% 3.66/3.13  % Search garbage collected termcells   : 66987
% 3.66/3.13  
% 3.66/3.13  % -------------------------------------------------
% 3.66/3.13  % User time                : 0.097 s
% 3.66/3.13  % System time              : 0.047 s
% 3.66/3.13  % Total time               : 0.144 s
% 3.66/3.13  % Maximum resident set size: 22744 pages
% 3.66/3.13  
% 3.66/3.13  % -------------------------------------------------
% 3.66/3.13  % User time                : 0.775 s
% 3.66/3.13  % System time              : 0.137 s
% 3.66/3.13  % Total time               : 0.911 s
% 3.66/3.13  % Maximum resident set size: 21248 pages
% 3.66/3.13  % E exiting
%------------------------------------------------------------------------------