TSTP Solution File: NUM925+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n020.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:36 EDT 2022
% Result : Theorem 0.12s 0.40s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
sPE(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)]) ).
cnf(g1,plain,
( ~ sPE(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int)
| sPE(plus_plus_int(one_one_int,semiri1621563631at_int(n)),zero_zero_int) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_92_power__eq__0__iff__number__of)]) ).
cnf(g2,plain,
( ~ sPE(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int)
| sPE(zero_zero_int,power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(zero_zero_int,zero_zero_int)
| ~ sPE(zero_zero_int,power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))))
| ~ ord_less_int(zero_zero_int,zero_zero_int)
| ord_less_int(zero_zero_int,power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
( ~ sPE(plus_plus_int(one_one_int,semiri1621563631at_int(n)),zero_zero_int)
| sPE(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g5,plain,
( ~ sPE(plus_plus_int(one_one_int,semiri1621563631at_int(n)),zero_zero_int)
| ~ ord_less_int(zero_zero_int,power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls))))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_103_zero__less__power2)]) ).
cnf(g6,plain,
( ~ sPE(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n)))
| ~ sPE(plus_plus_int(one_one_int,semiri1621563631at_int(n)),zero_zero_int)
| sPE(zero_zero_int,zero_zero_int) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(zero_zero_int,zero_zero_int)
| ~ sPE(plus_plus_int(one_one_int,semiri1621563631at_int(n)),zero_zero_int)
| ~ ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n)))
| ord_less_int(zero_zero_int,zero_zero_int) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jul 5 06:51:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.40 % symbols: 21
% 0.12/0.40 % clauses: 167
% 0.12/0.40 % start clauses: 1
% 0.12/0.40 % iterative deepening steps: 99
% 0.12/0.40 % maximum path limit: 3
% 0.12/0.40 % literal attempts: 35216
% 0.12/0.40 % depth failures: 32668
% 0.12/0.40 % regularity failures: 792
% 0.12/0.40 % tautology failures: 134
% 0.12/0.40 % reductions: 94
% 0.12/0.40 % extensions: 35178
% 0.12/0.40 % SAT variables: 6139
% 0.12/0.40 % SAT clauses: 6412
% 0.12/0.40 % WalkSAT solutions: 6409
% 0.12/0.40 % CDCL solutions: 0
% 0.12/0.40 % SZS status Theorem for theBenchmark
% 0.12/0.40 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------