TSTP Solution File: NUM924+6 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:15:13 EDT 2022
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 18 RR)
% Number of literals : 33 ( 27 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 19 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(42,hypothesis,
ti(int,bit0(X)) = bit0(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit0_res) ).
cnf(44,hypothesis,
ti(int,bit1(X)) = bit1(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OBit1_res) ).
cnf(45,axiom,
ti(int,min) = min,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_OMin_res) ).
cnf(73,axiom,
ti(int,m) = m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_v_m_res) ).
cnf(79,axiom,
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))),
file('/export/starexec/sandbox2/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(80,axiom,
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),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
cnf(106,axiom,
number_number_of(int,X) = ti(int,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
cnf(107,axiom,
times_times(int,X,Y) = times_times(int,Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
cnf(161,axiom,
times_times(int,pls,X) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
cnf(162,axiom,
times_times(int,bit0(X),Y) = bit0(times_times(int,X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_63_mult__Bit0) ).
cnf(233,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_109_one__is__num__one) ).
cnf(234,axiom,
times_times(int,bit1(X),Y) = plus_plus(int,bit0(times_times(int,X,Y)),Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_110_mult__Bit1) ).
cnf(251,axiom,
bit0(pls) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_119_Bit0__Pls) ).
cnf(252,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_120_Pls__def) ).
cnf(260,axiom,
plus_plus(int,X,pls) = ti(int,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_127_add__Pls__right) ).
cnf(261,plain,
plus_plus(int,X,pls) = number_number_of(int,X),
inference('REWRITE',[status(thm)],[260,106,theory(equality)]) ).
cnf(262,axiom,
plus_plus(int,pls,X) = ti(int,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_128_add__Pls) ).
cnf(263,plain,
plus_plus(int,pls,X) = number_number_of(int,X),
inference('REWRITE',[status(thm)],[262,106,theory(equality)]) ).
cnf(297,axiom,
plus_plus(int,bit0(X),bit1(Y)) = bit1(plus_plus(int,X,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_160_add__Bit0__Bit1) ).
cnf(550,axiom,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min)) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_324__096s_A_094_A2_A_N_A_N1_A_061_As_A_094_A2_A_L_A1_096) ).
cnf(875,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
cnf(876,plain,
~ ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),number_number_of(int,min)),pls),
inference('REWRITE',[status(thm)],[875,252,550,theory(equality)]) ).
cnf(895,plain,
number_number_of(int,m) = m,
inference('REWRITE',[status(thm)],[73,106,theory(equality)]) ).
cnf(901,plain,
number_number_of(int,min) = min,
inference('REWRITE',[status(thm)],[45,106,theory(equality)]) ).
cnf(915,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),min) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference('REWRITE',[status(thm)],[550,901,theory(equality)]) ).
cnf(920,plain,
~ ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),min),pls),
inference('REWRITE',[status(thm)],[876,901,theory(equality)]) ).
cnf(925,plain,
number_number_of(int,bit1(X)) = bit1(X),
inference('REWRITE',[status(thm)],[44,106,theory(equality)]) ).
cnf(930,plain,
one_one(int) = bit1(pls),
inference('REWRITE',[status(thm)],[233,925,theory(equality)]) ).
cnf(992,plain,
minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),min) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),bit1(pls)),
inference('REWRITE',[status(thm)],[915,930,theory(equality)]) ).
cnf(996,plain,
number_number_of(int,bit0(X)) = bit0(X),
inference('REWRITE',[status(thm)],[42,106,theory(equality)]) ).
cnf(1042,plain,
ord_less(int,minus_minus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),min),bit0(bit0(times_times(int,m,pls)))),
inference('REWRITE',[status(thm)],[79,252,261,297,895,263,251,161,234,162,996,992,930,80,theory(equality)]) ).
cnf(1065,plain,
times_times(int,X,pls) = pls,
inference('PARAMODULATE',[status(thm)],[161,107,theory(equality)]) ).
cnf(1066,plain,
$false,
inference('REWRITE',[status(thm)],[1042,920,251,1065,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM924+6 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 21:43:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-05T21:43:08
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-05T21:43:08
% 0.41/0.60
% 0.41/0.61 ; Recognized possible left identity assertion (|ord_less_eq| |int| ?X ?X).
% 0.41/0.61 ; Recognized commutativity assertion (OR (NOT (|zcong| ?X ?Y ?Z)) (|zcong| ?Y ?X ?Z)).
% 0.41/0.61 ; Recognized commutativity assertion (OR (|zcong| ?X ?Y ?Z) (NOT (|zcong| ?Y ?X ?Z))).
% 0.41/0.62 ; Recognized possible left identity assertion (|ord_less_eq| |real| ?X ?X).
% 0.61/0.80 ; Declaring zcong to be commutative.
% 0.61/0.80
% 0.61/0.80 #||
% 0.61/0.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.61/0.80 % SZS output start Refutation
% See solution above
% 0.61/0.80 ||#
% 0.61/0.80
% 0.61/0.80 ; Summary of computation:
% 0.61/0.80 ; 1436 formulas have been input or derived (from 166 formulas).
% 0.61/0.80 ; 1066 (74%) were retained. Of these,
% 0.61/0.80 ; 299 (28%) were simplified or subsumed later,
% 0.61/0.80 ; 767 (72%) are still being kept.
% 0.61/0.80 ;
% 0.61/0.80 ; Run time in seconds excluding printing time:
% 0.61/0.80 ; 0.132 39% Read assertion file (1 call)
% 0.61/0.80 ; 0.012 4% Assert (650 calls)
% 0.61/0.80 ; 0.082 24% Process new row (1,300 calls)
% 0.61/0.80 ; 0.006 2% Resolution (330 calls)
% 0.61/0.80 ; 0.002 1% Paramodulation (165 calls)
% 0.61/0.80 ; 0.000 0% Factoring (2 calls)
% 0.61/0.80 ; 0.009 3% Condensing (695 calls)
% 0.61/0.80 ; 0.011 3% Forward subsumption (695 calls)
% 0.61/0.80 ; 0.011 3% Backward subsumption (624 calls)
% 0.61/0.80 ; 0.002 1% Clause clause subsumption (538 calls)
% 0.61/0.80 ; 0.027 8% Forward simplification (1,300 calls)
% 0.61/0.80 ; 0.014 4% Backward simplification (951 calls)
% 0.61/0.80 ; 0.003 1% Ordering (366 calls)
% 0.61/0.80 ; 0.000 0% Sortal reasoning (32 calls)
% 0.61/0.80 ; 0.001 0% Purity testing (1 call)
% 0.61/0.80 ; 0.025 7% Other
% 0.61/0.80 ; 0.337 Total
% 0.61/0.80 ; 0.341 Real time
% 0.61/0.80 ;
% 0.61/0.80 ; Term-hash-array has 1,515 terms in all.
% 0.61/0.80 ; Feature-vector-row-index has 530 entries (530 at peak, 624 added, 94 deleted).
% 0.61/0.80 ; Feature-vector-row-index has 2,968 nodes (2,999 at peak, 3,991 added, 1,023 deleted).
% 0.61/0.80 ; Retrieved 358 possibly forward subsuming rows in 695 calls.
% 0.61/0.80 ; Retrieved 215 possibly backward subsumed rows in 624 calls.
% 0.61/0.80 ; Path-index has 1,271 entries (1,275 at peak, 1,617 added, 346 deleted).
% 0.61/0.80 ; Path-index has 4,644 nodes (4,649 at peak, 5,305 added, 661 deleted).
% 0.61/0.80 ; Trie-index has 1,271 entries (1,275 at peak, 1,617 added, 346 deleted).
% 0.61/0.80 ; Trie-index has 5,226 nodes (5,334 at peak, 7,235 added, 2,009 deleted).
% 0.61/0.80 ; Retrieved 1,579 generalization terms in 6,125 calls.
% 0.61/0.80 ; Retrieved 456 instance terms in 337 calls.
% 0.61/0.80 ; Retrieved 6,051 unifiable terms in 879 calls.
% 0.61/0.80 ;
% 0.61/0.80 ; The agenda of rows to process has 10 entries:
% 0.61/0.80 ; 4 with value 12 6 with value 13
% 0.61/0.80 ; The agenda of input rows to give has 578 entries:
% 0.61/0.80 ; 8 with value 11 11 with value 25 1 with value 43
% 0.61/0.80 ; 44 with value 12 6 with value 26 1 with value 44
% 0.61/0.80 ; 37 with value 13 37 with value 27 1 with value 45
% 0.61/0.80 ; 29 with value 14 16 with value 28 3 with value 46
% 0.61/0.80 ; 38 with value 15 7 with value 29 4 with value 47
% 0.61/0.80 ; 35 with value 16 4 with value 30 1 with value 48
% 0.61/0.80 ; 49 with value 17 11 with value 31 1 with value 50
% 0.61/0.80 ; 23 with value 18 2 with value 32 1 with value 52
% 0.61/0.80 ; 14 with value 19 4 with value 33 2 with value 53
% 0.61/0.80 ; 37 with value 20 10 with value 34 2 with value 56
% 0.61/0.80 ; 41 with value 21 3 with value 35 1 with value 62
% 0.61/0.80 ; 28 with value 22 6 with value 36 1 with value 98
% 0.61/0.80 ; 15 with value 23 4 with value 38 1 with value 100
% 0.61/0.80 ; 31 with value 24 8 with value 39
% 0.61/0.80 ; The agenda of rows to give has 23 entries:
% 0.61/0.80 ; 6 with value (4 6) 1 with value (4 9) 3 with value (4 11)
% 0.61/0.80 ; 8 with value (4 8) 5 with value (4 10)
% 0.61/0.80 Evaluation took:
% 0.61/0.80 0.341 seconds of real time
% 0.61/0.80 0.319136 seconds of user run time
% 0.61/0.80 0.022116 seconds of system run time
% 0.61/0.80 [Run times include 0.009 seconds GC run time.]
% 0.61/0.80 0 calls to %EVAL
% 0.61/0.80 0 page faults and
% 0.61/0.80 24,668,152 bytes consed.
% 0.61/0.80 :PROOF-FOUND
% 0.61/0.80 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-05T21:43:08
% 0.61/0.80 :PROOF-FOUND
% 0.61/0.80 *
%------------------------------------------------------------------------------