TSTP Solution File: NUM421+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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:10:22 EDT 2022
% Result : Theorem 1.08s 1.26s
% Output : Refutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 33 unt; 0 nHn; 46 RR)
% Number of literals : 68 ( 35 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aInteger0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntZero) ).
cnf(2,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntOne) ).
cnf(3,axiom,
( ~ aInteger0(X)
| aInteger0(smndt0(X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
cnf(4,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| aInteger0(sdtpldt0(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntPlus) ).
cnf(5,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| aInteger0(sdtasdt0(X,Y)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
cnf(6,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| ~ aInteger0(Z)
| sdtpldt0(X,sdtpldt0(Y,Z)) = sdtpldt0(sdtpldt0(X,Y),Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddAsso) ).
cnf(8,axiom,
( ~ aInteger0(X)
| sdtpldt0(X,sz00) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
cnf(9,axiom,
( ~ aInteger0(X)
| X = sdtpldt0(sz00,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddZero) ).
cnf(10,axiom,
( ~ aInteger0(X)
| sdtpldt0(X,smndt0(X)) = sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mAddNeg) ).
cnf(13,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| sdtasdt0(X,Y) = sdtasdt0(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulComm) ).
cnf(14,axiom,
( ~ aInteger0(X)
| sdtasdt0(X,sz10) = X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulOne) ).
cnf(15,axiom,
( ~ aInteger0(X)
| X = sdtasdt0(sz10,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulOne) ).
cnf(16,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| ~ aInteger0(Z)
| sdtasdt0(X,sdtpldt0(Y,Z)) = sdtpldt0(sdtasdt0(X,Y),sdtasdt0(X,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDistrib) ).
cnf(17,axiom,
( ~ aInteger0(X)
| ~ aInteger0(Y)
| ~ aInteger0(Z)
| sdtasdt0(sdtpldt0(X,Y),Z) = sdtpldt0(sdtasdt0(X,Z),sdtasdt0(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDistrib) ).
cnf(18,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__419) ).
cnf(19,negated_conjecture,
( sdtasdt0(xa,sz00) != sz00
| sz00 != sdtasdt0(sz00,xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
cnf(20,plain,
aInteger0(smndt0(xa)),
inference('HYPERRESOLVE',[status(thm)],[3,18]) ).
cnf(21,plain,
aInteger0(smndt0(sz10)),
inference('HYPERRESOLVE',[status(thm)],[3,2]) ).
cnf(23,plain,
sdtpldt0(xa,sz00) = xa,
inference('HYPERRESOLVE',[status(thm)],[8,18]) ).
cnf(24,plain,
sdtpldt0(sz10,sz00) = sz10,
inference('HYPERRESOLVE',[status(thm)],[8,2]) ).
cnf(25,plain,
sdtpldt0(sz00,sz00) = sz00,
inference('HYPERRESOLVE',[status(thm)],[8,1]) ).
cnf(27,plain,
sz10 = sdtpldt0(sz00,sz10),
inference('HYPERRESOLVE',[status(thm)],[9,2]) ).
cnf(28,plain,
sdtasdt0(xa,sz10) = xa,
inference('HYPERRESOLVE',[status(thm)],[14,18]) ).
cnf(30,plain,
sdtasdt0(sz00,sz10) = sz00,
inference('HYPERRESOLVE',[status(thm)],[14,1]) ).
cnf(32,plain,
sz00 = sdtasdt0(sz10,sz00),
inference('HYPERRESOLVE',[status(thm)],[15,1]) ).
cnf(34,plain,
aInteger0(sdtpldt0(xa,sz10)),
inference('HYPERRESOLVE',[status(thm)],[4,18,2]) ).
cnf(36,plain,
aInteger0(sdtpldt0(sz10,sz10)),
inference('HYPERRESOLVE',[status(thm)],[4,2,2]) ).
cnf(38,plain,
aInteger0(sdtasdt0(xa,sz00)),
inference('HYPERRESOLVE',[status(thm)],[5,18,1]) ).
cnf(41,plain,
sdtpldt0(xa,smndt0(xa)) = sz00,
inference('HYPERRESOLVE',[status(thm)],[10,18]) ).
cnf(42,plain,
sdtpldt0(sz10,smndt0(sz10)) = sz00,
inference('HYPERRESOLVE',[status(thm)],[10,2]) ).
cnf(48,plain,
sdtasdt0(xa,sz00) = sdtasdt0(sz00,xa),
inference('HYPERRESOLVE',[status(thm)],[13,18,1]) ).
cnf(95,plain,
xa = sdtpldt0(sdtasdt0(xa,sz00),xa),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,18,1,2]),28,27,theory(equality)]) ).
cnf(102,plain,
sdtasdt0(sz00,sdtpldt0(xa,sz10)) = sdtpldt0(sdtasdt0(sz00,xa),sz00),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,1,18,2]),30,theory(equality)]) ).
cnf(103,plain,
sdtasdt0(sz00,xa) = sdtpldt0(sdtasdt0(sz00,xa),sdtasdt0(sz00,sz00)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[16,1,18,1]),23,theory(equality)]) ).
cnf(115,plain,
sdtasdt0(sdtpldt0(xa,sz10),sz00) = sdtpldt0(sdtasdt0(xa,sz00),sz00),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,18,2,1]),32,theory(equality)]) ).
cnf(123,plain,
sdtasdt0(sdtpldt0(sz10,sz10),sz00) = sz00,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,2,2,1]),25,32,theory(equality)]) ).
cnf(338,plain,
sz10 = sdtpldt0(sdtpldt0(sz10,sz10),smndt0(sz10)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,21,2,2]),24,42,theory(equality)]) ).
cnf(370,plain,
sdtasdt0(sz00,sz00) = sdtpldt0(sz00,sdtasdt0(smndt0(sz10),sz00)),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,21,2,1]),32,42,theory(equality)]) ).
cnf(561,plain,
sdtasdt0(sdtpldt0(xa,sz10),sz00) = sdtasdt0(sz00,sdtpldt0(xa,sz10)),
inference('HYPERRESOLVE',[status(thm)],[13,34,1]) ).
cnf(1473,plain,
sz00 = sdtasdt0(sz00,sz00),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[17,36,21,1]),370,123,32,338,theory(equality)]) ).
cnf(1476,plain,
sdtasdt0(sz00,xa) = sdtasdt0(sz00,sdtpldt0(xa,sz10)),
inference('REWRITE',[status(thm)],[103,102,1473,theory(equality)]) ).
cnf(1478,plain,
sdtasdt0(sdtpldt0(xa,sz10),sz00) = sdtasdt0(sz00,xa),
inference('REWRITE',[status(thm)],[561,1476,theory(equality)]) ).
cnf(1479,plain,
sdtasdt0(sz00,xa) = sdtpldt0(sdtasdt0(xa,sz00),sz00),
inference('REWRITE',[status(thm)],[115,1478,theory(equality)]) ).
cnf(3113,plain,
sz00 = sdtasdt0(sz00,xa),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[6,38,18,20]),95,1479,41,theory(equality)]) ).
cnf(3114,plain,
sdtasdt0(xa,sz00) != sz00,
inference('REWRITE',[status(thm)],[19,3113,theory(equality)]) ).
cnf(3115,plain,
$false,
inference('REWRITE',[status(thm)],[48,3114,3113,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM421+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 22:44:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-07T22:44:39
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-07-07T22:44:39
% 1.08/1.26
% 1.08/1.26
% 1.08/1.26 #||
% 1.08/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.08/1.26 % SZS output start Refutation
% See solution above
% 1.08/1.26 ||#
% 1.08/1.26
% 1.08/1.26 ; Summary of computation:
% 1.08/1.26 ; 11897 formulas have been input or derived (from 28 formulas).
% 1.08/1.26 ; 3115 (26%) were retained. Of these,
% 1.08/1.26 ; 788 (25%) were simplified or subsumed later,
% 1.08/1.26 ; 2327 (75%) are still being kept.
% 1.08/1.26 ;
% 1.08/1.26 ; Run time in seconds excluding printing time:
% 1.08/1.26 ; 0.004 1% Read assertion file (1 call)
% 1.08/1.26 ; 0.001 0% Assert (16 calls)
% 1.08/1.26 ; 0.257 32% Process new row (9,345 calls)
% 1.08/1.26 ; 0.142 18% Resolution (54 calls)
% 1.08/1.26 ; 0.000 0% Paramodulation (27 calls)
% 1.08/1.26 ; 0.000 0% Condensing (16 calls)
% 1.08/1.26 ; 0.000 0% Forward subsumption (16 calls)
% 1.08/1.26 ; 0.000 0% Backward subsumption (16 calls)
% 1.08/1.26 ; 0.000 0% Clause clause subsumption (14 calls)
% 1.08/1.26 ; 0.197 25% Forward simplification (8,424 calls)
% 1.08/1.27 ; 0.107 13% Backward simplification (3,115 calls)
% 1.08/1.27 ; 0.022 3% Ordering (2,933 calls)
% 1.08/1.27 ; 0.001 0% Sortal reasoning (32 calls)
% 1.08/1.27 ; 0.000 0% Purity testing (1 call)
% 1.08/1.27 ; 0.063 8% Other
% 1.08/1.27 ; 0.794 Total
% 1.08/1.27 ; 0.797 Real time
% 1.08/1.27 ;
% 1.08/1.27 ; Term-hash-array has 6,875 terms in all.
% 1.08/1.27 ; Feature-vector-row-index has 15 entries (16 at peak, 16 added, 1 deleted).
% 1.08/1.27 ; Feature-vector-row-index has 39 nodes (49 at peak, 49 added, 10 deleted).
% 1.08/1.27 ; Retrieved 8 possibly forward subsuming rows in 16 calls.
% 1.08/1.27 ; Retrieved 6 possibly backward subsumed rows in 16 calls.
% 1.08/1.27 ; Path-index has 5,506 entries (6,064 at peak, 7,119 added, 1,613 deleted).
% 1.08/1.27 ; Path-index has 1,015 nodes (1,025 at peak, 1,059 added, 44 deleted).
% 1.08/1.27 ; Trie-index has 5,506 entries (6,064 at peak, 7,119 added, 1,613 deleted).
% 1.08/1.27 ; Trie-index has 29,748 nodes (31,967 at peak, 36,389 added, 6,641 deleted).
% 1.08/1.27 ; Retrieved 14,391 generalization terms in 62,721 calls.
% 1.08/1.27 ; Retrieved 3,102 instance terms in 3,098 calls.
% 1.08/1.27 ; Retrieved 102,999 unifiable terms in 9,192 calls.
% 1.08/1.27 ;
% 1.08/1.27 ; The agenda of backward simplifiable rows to process has 270 entries:
% 1.08/1.27 ; 270 with value 0
% 1.08/1.27 ; The agenda of rows to process has 2270 entries:
% 1.08/1.27 ; 194 with value 23 408 with value 27 80 with value 30
% 1.08/1.27 ; 492 with value 25 32 with value 28 160 with value 31
% 1.08/1.27 ; 48 with value 26 556 with value 29 300 with value 33
% 1.08/1.27 ; The agenda of input rows to give has 1 entry:
% 1.08/1.27 ; 1 with value 7
% 1.08/1.27 ; The agenda of rows to give has 2300 entries:
% 1.08/1.27 ; 11 with value (4 8) 63 with value (4 17) 77 with value (4 26)
% 1.08/1.27 ; 4 with value (4 9) 84 with value (4 18) 269 with value (4 27)
% 1.08/1.27 ; 21 with value (4 10) 120 with value (4 19) 38 with value (4 28)
% 1.08/1.27 ; 29 with value (4 11) 63 with value (4 20) 184 with value (4 29)
% 1.08/1.27 ; 36 with value (4 12) 224 with value (4 21) 64 with value (4 30)
% 1.08/1.27 ; 58 with value (4 13) 62 with value (4 22) 48 with value (4 31)
% 1.08/1.27 ; 21 with value (4 14) 238 with value (4 23) 32 with value (4 32)
% 1.08/1.27 ; 22 with value (4 15) 132 with value (4 24) 112 with value (4 33)
% 1.08/1.27 ; 51 with value (4 16) 237 with value (4 25)
% 1.08/1.27 Evaluation took:
% 1.08/1.27 0.798 seconds of real time
% 1.08/1.27 0.741741 seconds of user run time
% 1.08/1.27 0.056014 seconds of system run time
% 1.08/1.27 [Run times include 0.111 seconds GC run time.]
% 1.08/1.27 0 calls to %EVAL
% 1.08/1.27 0 page faults and
% 1.08/1.27 66,308,336 bytes consed.
% 1.08/1.27 :PROOF-FOUND
% 1.08/1.27 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-07T22:44:40
% 1.08/1.27 :PROOF-FOUND
% 1.08/1.27 *
%------------------------------------------------------------------------------