TSTP Solution File: TOP053-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : TOP053-1 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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 : Thu Jul 21 21:34:49 EDT 2022
% Result : Unsatisfiable 0.46s 0.64s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 19
% Syntax : Number of clauses : 82 ( 82 unt; 0 nHn; 68 RR)
% Number of literals : 82 ( 81 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-14 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(involutory_quandle,axiom,
product(X,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle) ).
cnf(involutory_quandle_01,axiom,
product(product(X,Y),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle_01) ).
cnf(involutory_quandle_02,axiom,
product(product(X,Y),Z) = product(product(X,Z),product(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutory_quandle_02) ).
cnf(knot,axiom,
product(a1,a2) = a3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot) ).
cnf(knot_03,axiom,
product(a3,a4) = a5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_03) ).
cnf(knot_04,axiom,
product(a5,a6) = a7,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_04) ).
cnf(knot_05,axiom,
product(a7,a3) = a8,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_05) ).
cnf(knot_06,axiom,
product(a8,a2) = a9,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_06) ).
cnf(knot_07,axiom,
product(a9,a1) = a10,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_07) ).
cnf(knot_08,axiom,
product(a10,a11) = a12,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_08) ).
cnf(knot_09,axiom,
product(a12,a3) = a13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_09) ).
cnf(knot_10,axiom,
product(a13,a8) = a6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_10) ).
cnf(knot_11,axiom,
product(a6,a7) = a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_11) ).
cnf(knot_12,axiom,
product(a2,a12) = a14,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_12) ).
cnf(knot_13,axiom,
product(a14,a3) = a15,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_13) ).
cnf(knot_14,axiom,
product(a15,a8) = a4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_14) ).
cnf(knot_15,axiom,
product(a4,a7) = a11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_15) ).
cnf(knot_16,axiom,
product(a11,a10) = a1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',knot_16) ).
cnf(goal,negated_conjecture,
tuple(a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14) != tuple(a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(22,plain,
product(a1,a10) = a11,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_16,theory(equality)]) ).
cnf(25,plain,
product(a2,a7) = a6,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_11,theory(equality)]) ).
cnf(26,plain,
product(a11,a7) = a4,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_15,theory(equality)]) ).
cnf(27,plain,
product(a7,a6) = a5,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_04,theory(equality)]) ).
cnf(28,plain,
product(a5,a4) = a3,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_03,theory(equality)]) ).
cnf(29,plain,
product(a8,a3) = a7,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_05,theory(equality)]) ).
cnf(30,plain,
product(a13,a3) = a12,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_09,theory(equality)]) ).
cnf(31,plain,
product(a15,a3) = a14,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_13,theory(equality)]) ).
cnf(32,plain,
product(a3,a2) = a1,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot,theory(equality)]) ).
cnf(33,plain,
product(a9,a2) = a8,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_06,theory(equality)]) ).
cnf(35,plain,
product(a14,X) = product(product(a2,X),product(a12,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_12,theory(equality)]) ).
cnf(36,plain,
product(a12,X) = product(product(a10,X),product(a11,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_08,theory(equality)]) ).
cnf(38,plain,
product(a6,X) = product(product(a13,X),product(a8,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_10,theory(equality)]) ).
cnf(39,plain,
product(a4,X) = product(product(a15,X),product(a8,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_14,theory(equality)]) ).
cnf(40,plain,
product(a2,X) = product(product(a6,X),product(a7,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_11,theory(equality)]) ).
cnf(41,plain,
product(a11,X) = product(product(a4,X),product(a7,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_15,theory(equality)]) ).
cnf(42,plain,
product(a7,X) = product(product(a5,X),product(a6,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_04,theory(equality)]) ).
cnf(49,plain,
product(a10,X) = product(product(a9,X),product(a1,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_07,theory(equality)]) ).
cnf(109,plain,
product(product(X,a2),a7) = product(product(X,a7),a6),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,25,theory(equality)]) ).
cnf(115,plain,
product(product(X,a2),a7) = product(product(X,a6),a5),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,27,theory(equality)]),109,theory(equality)]) ).
cnf(184,plain,
product(a6,a3) = product(a12,a7),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,30,theory(equality)]),29,theory(equality)]) ).
cnf(190,plain,
product(product(a6,a3),a7) = a12,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,184,theory(equality)]) ).
cnf(191,plain,
product(a14,a7) = product(a6,product(a6,a3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,184,theory(equality)]),25,theory(equality)]) ).
cnf(203,plain,
product(a4,a3) = product(a14,a7),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[39,31,theory(equality)]),29,theory(equality)]) ).
cnf(204,plain,
product(a4,a3) = product(a6,product(a6,a3)),
inference('REWRITE',[status(thm)],[191,203,theory(equality)]) ).
cnf(210,plain,
product(product(a4,a3),a7) = a14,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,203,theory(equality)]) ).
cnf(222,plain,
product(a2,a6) = product(a6,a5),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[40,involutory_quandle,theory(equality)]),27,theory(equality)]) ).
cnf(230,plain,
product(product(X,a2),a7) = product(product(X,a5),product(a2,a6)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,222,theory(equality)]),115,theory(equality)]) ).
cnf(251,plain,
product(a7,a5) = product(a5,product(a2,a6)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42,involutory_quandle,theory(equality)]),222,theory(equality)]) ).
cnf(257,plain,
product(product(a7,a2),a7) = a5,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,251,theory(equality)]),230,theory(equality)]) ).
cnf(348,plain,
product(a10,a2) = a7,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[49,33,theory(equality)]),29,knot,theory(equality)]) ).
cnf(353,plain,
product(a7,a2) = a10,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,348,theory(equality)]) ).
cnf(354,plain,
product(a10,a7) = a5,
inference('REWRITE',[status(thm)],[257,353,theory(equality)]) ).
cnf(372,plain,
product(a11,a2) = product(product(a4,a10),product(a2,a10)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[41,353,theory(equality)]),involutory_quandle_02,theory(equality)]) ).
cnf(381,plain,
product(a6,a3) = a3,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[36,354,theory(equality)]),28,26,184,theory(equality)]) ).
cnf(383,plain,
product(a3,a7) = a12,
inference('REWRITE',[status(thm)],[190,381,theory(equality)]) ).
cnf(397,plain,
product(a4,a3) = a3,
inference('REWRITE',[status(thm)],[204,381,theory(equality)]) ).
cnf(399,plain,
a12 = a14,
inference('REWRITE',[status(thm)],[210,383,397,theory(equality)]) ).
cnf(400,plain,
product(a2,a12) = a12,
inference('REWRITE',[status(thm)],[knot_12,399,theory(equality)]) ).
cnf(401,plain,
a13 = a15,
inference('REWRITE',[status(thm)],[knot_13,knot_09,399,theory(equality)]) ).
cnf(402,plain,
a6 = a4,
inference('REWRITE',[status(thm)],[knot_14,knot_10,401,theory(equality)]) ).
cnf(403,plain,
a3 = a7,
inference('REWRITE',[status(thm)],[knot_04,28,402,theory(equality)]) ).
cnf(404,plain,
a3 = a8,
inference('REWRITE',[status(thm)],[knot_05,involutory_quandle,403,theory(equality)]) ).
cnf(405,plain,
a1 = a9,
inference('REWRITE',[status(thm)],[knot_06,32,404,theory(equality)]) ).
cnf(406,plain,
a1 = a10,
inference('REWRITE',[status(thm)],[knot_07,involutory_quandle,405,theory(equality)]) ).
cnf(407,plain,
product(a1,a11) = a12,
inference('REWRITE',[status(thm)],[knot_08,406,theory(equality)]) ).
cnf(414,plain,
a1 = a11,
inference('REWRITE',[status(thm)],[22,involutory_quandle,406,theory(equality)]) ).
cnf(415,plain,
a1 = a12,
inference('REWRITE',[status(thm)],[407,involutory_quandle,414,theory(equality)]) ).
cnf(416,plain,
product(a1,a3) = a13,
inference('REWRITE',[status(thm)],[knot_09,415,theory(equality)]) ).
cnf(433,plain,
product(a2,a1) = a1,
inference('REWRITE',[status(thm)],[400,415,theory(equality)]) ).
cnf(440,plain,
a3 = a4,
inference('REWRITE',[status(thm)],[372,involutory_quandle_01,433,knot,414,406,theory(equality)]) ).
cnf(441,plain,
a3 = a5,
inference('REWRITE',[status(thm)],[knot_03,involutory_quandle,440,theory(equality)]) ).
cnf(442,plain,
a6 = a3,
inference('REWRITE',[status(thm)],[402,440,theory(equality)]) ).
cnf(450,plain,
a3 = a1,
inference('REWRITE',[status(thm)],[knot_15,414,involutory_quandle,440,403,theory(equality)]) ).
cnf(458,plain,
a1 = a7,
inference('REWRITE',[status(thm)],[403,450,theory(equality)]) ).
cnf(459,plain,
a1 = a8,
inference('REWRITE',[status(thm)],[404,450,theory(equality)]) ).
cnf(460,plain,
a1 = a13,
inference('REWRITE',[status(thm)],[416,involutory_quandle,450,theory(equality)]) ).
cnf(461,plain,
a1 = a15,
inference('REWRITE',[status(thm)],[401,460,theory(equality)]) ).
cnf(462,plain,
a1 = a4,
inference('REWRITE',[status(thm)],[440,450,theory(equality)]) ).
cnf(463,plain,
a1 = a5,
inference('REWRITE',[status(thm)],[441,450,theory(equality)]) ).
cnf(464,plain,
a6 = a1,
inference('REWRITE',[status(thm)],[442,450,theory(equality)]) ).
cnf(467,plain,
a1 = a2,
inference('REWRITE',[status(thm)],[knot_11,involutory_quandle,458,462,402,theory(equality)]) ).
cnf(468,plain,
$false,
inference('REWRITE',[status(thm)],[goal,461,460,415,414,406,405,459,458,464,463,462,450,467,399,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP053-1 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n024.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 : Sun May 29 14:29:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T14:29:06
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-05-29T14:29:06
% 0.46/0.63
% 0.46/0.63
% 0.46/0.64 #||
% 0.46/0.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.64 % SZS output start Refutation
% See solution above
% 0.46/0.65 ||#
% 0.46/0.65
% 0.46/0.65 ; Summary of computation:
% 0.46/0.65 ; 1112 formulas have been input or derived (from 92 formulas).
% 0.46/0.65 ; 468 (42%) were retained. Of these,
% 0.46/0.65 ; 440 (94%) were simplified or subsumed later,
% 0.46/0.65 ; 28 ( 6%) are still being kept.
% 0.46/0.65 ;
% 0.46/0.65 ; Run time in seconds excluding printing time:
% 0.46/0.65 ; 0.003 2% Read assertion file (1 call)
% 0.46/0.65 ; 0.000 0% Assert (19 calls)
% 0.46/0.65 ; 0.042 25% Process new row (1,042 calls)
% 0.46/0.65 ; 0.003 2% Resolution (182 calls)
% 0.46/0.65 ; 0.012 7% Paramodulation (91 calls)
% 0.46/0.65 ; 0.042 25% Forward simplification (1,042 calls)
% 0.46/0.65 ; 0.020 12% Backward simplification (468 calls)
% 0.46/0.65 ; 0.016 10% Ordering (3,403 calls)
% 0.46/0.65 ; 0.000 0% Sortal reasoning (32 calls)
% 0.46/0.65 ; 0.000 0% Purity testing (1 call)
% 0.46/0.65 ; 0.029 17% Other
% 0.46/0.65 ; 0.167 Total
% 0.46/0.65 ; 0.179 Real time
% 0.46/0.65 ;
% 0.46/0.65 ; Term-hash-array has 1,277 terms in all.
% 0.46/0.65 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.46/0.65 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.46/0.65 ; Path-index has 84 entries (1,086 at peak, 1,394 added, 1,310 deleted).
% 0.46/0.65 ; Path-index has 133 nodes (529 at peak, 620 added, 487 deleted).
% 0.46/0.65 ; Trie-index has 84 entries (1,086 at peak, 1,394 added, 1,310 deleted).
% 0.46/0.65 ; Trie-index has 191 nodes (4,122 at peak, 5,182 added, 4,991 deleted).
% 0.46/0.65 ; Retrieved 8,341 generalization terms in 5,431 calls.
% 0.46/0.65 ; Retrieved 573 instance terms in 489 calls.
% 0.46/0.65 ; Retrieved 2,006 unifiable terms in 641 calls.
% 0.46/0.65 ;
% 0.46/0.65 ; The agenda of backward simplifiable rows to process has 64 entries:
% 0.46/0.65 ; 64 with value 0
% 0.46/0.65 ; The agenda of rows to process has 3 entries:
% 0.46/0.65 ; 3 with value 18
% 0.46/0.65 ; The agenda of input rows to give has 11 entries:
% 0.46/0.65 ; 11 with value 4
% 0.46/0.65 ; The agenda of rows to give has 13 entries:
% 0.46/0.65 ; 1 with value (4 5) 1 with value (4 15) 4 with value (4 24)
% 0.46/0.65 ; 1 with value (4 7) 3 with value (4 18) 2 with value (4 26)
% 0.46/0.65 ; 1 with value (4 8)
% 0.46/0.65 Evaluation took:
% 0.46/0.65 0.179 seconds of real time
% 0.46/0.65 0.156889 seconds of user run time
% 0.46/0.65 0.022189 seconds of system run time
% 0.46/0.65 [Run times include 0.007 seconds GC run time.]
% 0.46/0.65 0 calls to %EVAL
% 0.46/0.65 0 page faults and
% 0.46/0.65 15,061,672 bytes consed.
% 0.46/0.65 :PROOF-FOUND
% 0.46/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T14:29:07
% 0.46/0.65 :PROOF-FOUND
% 0.46/0.65 *
%------------------------------------------------------------------------------