↑ Up

SATCoP---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SATCoP---0.1
% Problem  : NUM924+2 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satcop --statistics %s

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 14:05:32 EDT 2022

% Result   : Theorem 7.75s 1.40s
% Output   : Proof 7.75s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(g0,plain,
    ~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)]) ).

cnf(g1,plain,
    ( ~ sPE(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int))
    | ~ sPE(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int),zero_zero_int)
    | ~ ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int))
    | ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g2,plain,
    ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096)]) ).

cnf(g3,plain,
    ( ~ sPE(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t))
    | sPE(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int)) ),
    inference(ground_cnf,[],[theory(equality)]) ).

cnf(g4,plain,
    sPE(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t)),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t)]) ).

cnf(g5,plain,
    sPE(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int),zero_zero_int),
    inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM924+2 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13  % Command  : satcop --statistics %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jul  7 21:08:44 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 7.75/1.40  % symbols: 57
% 7.75/1.40  % clauses: 995
% 7.75/1.40  % start clauses: 1
% 7.75/1.40  % iterative deepening steps: 936
% 7.75/1.40  % maximum path limit: 3
% 7.75/1.40  % literal attempts: 1572038
% 7.75/1.40  % depth failures: 1417902
% 7.75/1.40  % regularity failures: 66526
% 7.75/1.40  % tautology failures: 10978
% 7.75/1.40  % reductions: 20569
% 7.75/1.40  % extensions: 1551278
% 7.75/1.40  % SAT variables: 238352
% 7.75/1.40  % SAT clauses: 243880
% 7.75/1.40  % WalkSAT solutions: 243854
% 7.75/1.40  % CDCL solutions: 24
% 7.75/1.40  % SZS status Theorem for theBenchmark
% 7.75/1.40  % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------