↑ 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  : ITP150^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 : n006.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.58s 0.44s
% Output   : CNFRefutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (  19 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (  26 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  175 (   8   ~;   3   |;   1   &; 162   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    3 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   6   ^;  28   !;   0   ?;  34   :)

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

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

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

thf(decl_28,type,
    times_times_a: a > a > a ).

thf(decl_34,type,
    polyno422358502poly_a: list_a > polyno727731844poly_a > a ).

thf(decl_60,type,
    polyno1491482291_Mul_a: polyno727731844poly_a > polyno727731844poly_a > polyno727731844poly_a ).

thf(decl_72,type,
    polyno1934269411ymul_a: polyno727731844poly_a > polyno727731844poly_a > polyno727731844poly_a ).

thf(decl_85,type,
    p: polyno727731844poly_a ).

thf(decl_86,type,
    q: polyno727731844poly_a ).

thf(decl_87,type,
    esk1_0: list_a ).

thf(conj_0,conjecture,
    ( ( polyno1934269411ymul_a @ p @ q )
    = ( polyno1934269411ymul_a @ q @ p ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2yIdFTAHpD/E---3.1_1239031.p',conj_0) ).

thf(fact_10_polymul,axiom,
    ! [X18: list_a,X2: polyno727731844poly_a,X3: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X18 @ ( polyno1934269411ymul_a @ X2 @ X3 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X18 @ X2 ) @ ( polyno422358502poly_a @ X18 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2yIdFTAHpD/E---3.1_1239031.p',fact_10_polymul) ).

thf(fact_29_Ipoly_Osimps_I6_J,axiom,
    ! [X72: list_a,X73: polyno727731844poly_a,X74: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X72 @ ( polyno1491482291_Mul_a @ X73 @ X74 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X72 @ X73 ) @ ( polyno422358502poly_a @ X72 @ X74 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2yIdFTAHpD/E---3.1_1239031.p',fact_29_Ipoly_Osimps_I6_J) ).

thf(fact_132_mult_Ocommute,axiom,
    ( times_times_a
    = ( ^ [X228: a,X229: a] : ( times_times_a @ X229 @ X228 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2yIdFTAHpD/E---3.1_1239031.p',fact_132_mult_Ocommute) ).

thf(fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062,axiom,
    ( ! [X1: list_a] :
        ( ( polyno422358502poly_a @ X1 @ ( polyno1934269411ymul_a @ p @ q ) )
        = ( polyno422358502poly_a @ X1 @ ( polyno1934269411ymul_a @ q @ p ) ) )
  <=> ( ( polyno1934269411ymul_a @ p @ q )
      = ( polyno1934269411ymul_a @ q @ p ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.2yIdFTAHpD/E---3.1_1239031.p',fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062) ).

thf(c_0_5,negated_conjecture,
    ( ( polyno1934269411ymul_a @ p @ q )
   != ( polyno1934269411ymul_a @ q @ p ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_6,plain,
    ! [X1464: list_a,X1465: polyno727731844poly_a,X1466: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1464 @ ( polyno1934269411ymul_a @ X1465 @ X1466 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X1464 @ X1465 ) @ ( polyno422358502poly_a @ X1464 @ X1466 ) ) ),
    inference(variable_rename,[status(thm)],[fact_10_polymul]) ).

thf(c_0_7,plain,
    ! [X1533: list_a,X1534: polyno727731844poly_a,X1535: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1533 @ ( polyno1491482291_Mul_a @ X1534 @ X1535 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X1533 @ X1534 ) @ ( polyno422358502poly_a @ X1533 @ X1535 ) ) ),
    inference(variable_rename,[status(thm)],[fact_29_Ipoly_Osimps_I6_J]) ).

thf(c_0_8,negated_conjecture,
    ( ( polyno1934269411ymul_a @ p @ q )
   != ( polyno1934269411ymul_a @ q @ p ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ( times_times_a
    = ( ^ [Z0: a,Z1: a] : ( times_times_a @ Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_132_mult_Ocommute]) ).

thf(c_0_10,plain,
    ! [X1443: list_a] :
      ( ( ( ( polyno422358502poly_a @ esk1_0 @ ( polyno1934269411ymul_a @ p @ q ) )
         != ( polyno422358502poly_a @ esk1_0 @ ( polyno1934269411ymul_a @ q @ p ) ) )
        | ( ( polyno1934269411ymul_a @ p @ q )
          = ( polyno1934269411ymul_a @ q @ p ) ) )
      & ( ( ( polyno1934269411ymul_a @ p @ q )
         != ( polyno1934269411ymul_a @ q @ p ) )
        | ( ( polyno422358502poly_a @ X1443 @ ( polyno1934269411ymul_a @ p @ q ) )
          = ( polyno422358502poly_a @ X1443 @ ( polyno1934269411ymul_a @ q @ p ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062])])])])]) ).

thf(c_0_11,plain,
    ! [X1: list_a,X2: polyno727731844poly_a,X3: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1 @ ( polyno1934269411ymul_a @ X2 @ X3 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X1 @ X2 ) @ ( polyno422358502poly_a @ X1 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_12,plain,
    ! [X1: list_a,X2: polyno727731844poly_a,X3: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1 @ ( polyno1491482291_Mul_a @ X2 @ X3 ) )
      = ( times_times_a @ ( polyno422358502poly_a @ X1 @ X2 ) @ ( polyno422358502poly_a @ X1 @ X3 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_13,negated_conjecture,
    ( ( polyno1934269411ymul_a @ p @ q )
   != ( polyno1934269411ymul_a @ q @ p ) ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

thf(c_0_14,plain,
    ( times_times_a
    = ( ^ [Z0: a,Z1: a] : ( times_times_a @ Z1 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ( ( ( polyno1934269411ymul_a @ p @ q )
      = ( polyno1934269411ymul_a @ q @ p ) )
    | ( ( polyno422358502poly_a @ esk1_0 @ ( polyno1934269411ymul_a @ p @ q ) )
     != ( polyno422358502poly_a @ esk1_0 @ ( polyno1934269411ymul_a @ q @ p ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_16,plain,
    ! [X1: list_a,X2: polyno727731844poly_a,X3: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1 @ ( polyno1934269411ymul_a @ X2 @ X3 ) )
      = ( polyno422358502poly_a @ X1 @ ( polyno1491482291_Mul_a @ X2 @ X3 ) ) ),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ( ( polyno1934269411ymul_a @ p @ q )
   != ( polyno1934269411ymul_a @ q @ p ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_18,plain,
    ! [X22: a,X21: a] :
      ( ( times_times_a @ X21 @ X22 )
      = ( times_times_a @ X22 @ X21 ) ),
    inference(arg_cong,[status(thm)],[c_0_14]) ).

thf(c_0_19,plain,
    ( ( polyno422358502poly_a @ esk1_0 @ ( polyno1491482291_Mul_a @ q @ p ) )
   != ( polyno422358502poly_a @ esk1_0 @ ( polyno1491482291_Mul_a @ p @ q ) ) ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_17]) ).

thf(c_0_20,plain,
    ! [X1: list_a,X3: polyno727731844poly_a,X2: polyno727731844poly_a] :
      ( ( polyno422358502poly_a @ X1 @ ( polyno1491482291_Mul_a @ X2 @ X3 ) )
      = ( polyno422358502poly_a @ X1 @ ( polyno1491482291_Mul_a @ X3 @ X2 ) ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_12]) ).

thf(c_0_21,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP150^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.06/0.19  % Computer : n006.cluster.edu
% 0.06/0.19  % Model    : x86_64 x86_64
% 0.06/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.19  % Memory   : 8046.5625MB
% 0.06/0.19  % OS       : Linux 6.8.0-71-generic
% 0.06/0.19  % CPULimit : 300
% 0.06/0.19  % WCLimit  : 300
% 0.06/0.19  % DateTime : Tue Sep 29 20:01:51 UTC 2026
% 0.06/0.19  % CPUTime  : 
% 0.06/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.24  Running higher-order theorem proving
% 0.24/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.2yIdFTAHpD/E---3.1_1239031.p
% 0.58/0.44  % Version: 3.5.1-ho
% 0.58/0.44  % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.58/0.44  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.44  % Starting new_ho_10 with 900s (3) cores
% 0.58/0.44  % Starting sh2lt with 300s (1) cores
% 0.58/0.44  % Starting new_ho_5 with 300s (1) cores
% 0.58/0.44  % Starting full_lambda_5 with 300s (1) cores
% 0.58/0.44  % Starting sh9 with 300s (1) cores
% 0.58/0.44  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.58/0.44  % full_lambda_5 with pid 1239050 completed with status 0
% 0.58/0.44  % Result found by full_lambda_5
% 0.58/0.44  % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.58/0.44  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.44  % Starting new_ho_10 with 900s (3) cores
% 0.58/0.44  % Starting sh2lt with 300s (1) cores
% 0.58/0.44  % Starting new_ho_5 with 300s (1) cores
% 0.58/0.44  % Starting full_lambda_5 with 300s (1) cores
% 0.58/0.44  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.44  % No SInE strategy applied
% 0.58/0.44  % Search class: HGUSM-FMLM31-MSFFFFBN
% 0.58/0.44  % partial match(1): HGUSM-SMLM31-MSFFFFBN
% 0.58/0.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.44  % Starting SubtermCWHack with 28s (1) cores
% 0.58/0.44  % SubtermCWHack with pid 1239054 completed with status 0
% 0.58/0.44  % Result found by SubtermCWHack
% 0.58/0.44  % Preprocessing class: HSLSSMSMSSSNSFA.
% 0.58/0.44  % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.58/0.44  % Starting new_ho_10 with 900s (3) cores
% 0.58/0.44  % Starting sh2lt with 300s (1) cores
% 0.58/0.44  % Starting new_ho_5 with 300s (1) cores
% 0.58/0.44  % Starting full_lambda_5 with 300s (1) cores
% 0.58/0.44  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.58/0.44  % No SInE strategy applied
% 0.58/0.44  % Search class: HGUSM-FMLM31-MSFFFFBN
% 0.58/0.44  % partial match(1): HGUSM-SMLM31-MSFFFFBN
% 0.58/0.44  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.58/0.44  % Starting SubtermCWHack with 28s (1) cores
% 0.58/0.44  % Preprocessing time       : 0.010 s
% 0.58/0.44  
% 0.58/0.44  % Proof found!
% 0.58/0.44  % SZS status Theorem
% 0.58/0.44  % SZS output start CNFRefutation
% See solution above
% 0.58/0.44  % Parsed axioms                        : 426
% 0.58/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.58/0.44  % Initial clauses                      : 1046
% 0.58/0.44  % Removed in clause preprocessing      : 113
% 0.58/0.44  % Initial clauses in saturation        : 933
% 0.58/0.44  % Processed clauses                    : 1051
% 0.58/0.44  % ...of these trivial                  : 58
% 0.58/0.44  % ...subsumed                          : 372
% 0.58/0.44  % ...remaining for further processing  : 621
% 0.58/0.44  % Other redundant clauses eliminated   : 61
% 0.58/0.44  % Clauses deleted for lack of memory   : 0
% 0.58/0.44  % Backward-subsumed                    : 3
% 0.58/0.44  % Backward-rewritten                   : 21
% 0.58/0.44  % Generated clauses                    : 2822
% 0.58/0.44  % ...of the previous two non-redundant : 2058
% 0.58/0.44  % ...aggressively subsumed             : 0
% 0.58/0.44  % Contextual simplify-reflections      : 1
% 0.58/0.44  % Paramodulations                      : 2683
% 0.58/0.44  % Factorizations                       : 0
% 0.58/0.44  % NegExts                              : 0
% 0.58/0.44  % Equation resolutions                 : 80
% 0.58/0.44  % Disequality decompositions           : 0
% 0.58/0.44  % Total rewrite steps                  : 1646
% 0.58/0.44  % ...of those cached                   : 1259
% 0.58/0.44  % Propositional unsat checks           : 0
% 0.58/0.44  %    Propositional check models        : 0
% 0.58/0.44  %    Propositional check unsatisfiable : 0
% 0.58/0.44  %    Propositional clauses             : 0
% 0.58/0.44  %    Propositional clauses after purity: 0
% 0.58/0.44  %    Propositional unsat core size     : 0
% 0.58/0.44  %    Propositional preprocessing time  : 0.000
% 0.58/0.44  %    Propositional encoding time       : 0.000
% 0.58/0.44  %    Propositional solver time         : 0.000
% 0.58/0.44  %    Success case prop preproc time    : 0.000
% 0.58/0.44  %    Success case prop encoding time   : 0.000
% 0.58/0.44  %    Success case prop solver time     : 0.000
% 0.58/0.44  % Current number of processed clauses  : 543
% 0.58/0.44  %    Positive orientable unit clauses  : 316
% 0.58/0.44  %    Positive unorientable unit clauses: 18
% 0.58/0.44  %    Negative unit clauses             : 80
% 0.58/0.44  %    Non-unit-clauses                  : 129
% 0.58/0.44  % Current number of unprocessed clauses: 1938
% 0.58/0.44  % ...number of literals in the above   : 5752
% 0.58/0.44  % Current number of archived formulas  : 0
% 0.58/0.44  % Current number of archived clauses   : 26
% 0.58/0.44  % Clause-clause subsumption calls (NU) : 8902
% 0.58/0.44  % Rec. Clause-clause subsumption calls : 7853
% 0.58/0.44  % Non-unit clause-clause subsumptions  : 230
% 0.58/0.44  % Unit Clause-clause subsumption calls : 3828
% 0.58/0.44  % Rewrite failures with RHS unbound    : 9
% 0.58/0.44  % BW rewrite match attempts            : 1124
% 0.58/0.44  % BW rewrite match successes           : 105
% 0.58/0.44  % Condensation attempts                : 0
% 0.58/0.44  % Condensation successes               : 0
% 0.58/0.44  % Termbank termtop insertions          : 86536
% 0.58/0.44  % Search garbage collected termcells   : 10016
% 0.58/0.44  
% 0.58/0.44  % -------------------------------------------------
% 0.58/0.44  % User time                : 0.096 s
% 0.58/0.44  % System time              : 0.013 s
% 0.58/0.44  % Total time               : 0.109 s
% 0.58/0.44  % Maximum resident set size: 6924 pages
% 0.58/0.44  
% 0.58/0.44  % -------------------------------------------------
% 0.58/0.44  % User time                : 0.108 s
% 0.58/0.44  % System time              : 0.020 s
% 0.58/0.44  % Total time               : 0.128 s
% 0.58/0.44  % Maximum resident set size: 5376 pages
% 0.58/0.44  % E exiting
%------------------------------------------------------------------------------