TSTP Solution File: TOP049-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : TOP049-1 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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:28 EDT 2022
% Result : Unsatisfiable 0.42s 0.59s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 35 RR)
% Number of literals : 43 ( 42 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 : 12 ( 12 usr; 10 con; 0-9 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(involutory_quandle,axiom,
product(X,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutory_quandle) ).
cnf(involutory_quandle_01,axiom,
product(product(X,Y),Y) = X,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',involutory_quandle_02) ).
cnf(knot_03,axiom,
a3 = product(a1,a2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_03) ).
cnf(knot_04,axiom,
a2 = product(a3,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_04) ).
cnf(knot_05,axiom,
a5 = product(a2,a10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_05) ).
cnf(knot_06,axiom,
a6 = product(a5,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_06) ).
cnf(knot_07,axiom,
a7 = product(a6,a1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_07) ).
cnf(knot_08,axiom,
a8 = product(a7,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_08) ).
cnf(knot_09,axiom,
a10 = product(a8,a9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_09) ).
cnf(knot_10,axiom,
a4 = product(a10,a3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_10) ).
cnf(knot_11,axiom,
a9 = product(a4,a8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_11) ).
cnf(goal,negated_conjecture,
tuple(a1,a9,a8,a6,a7,a2,a3,a4,a5) != tuple(a2,a10,a9,a7,a8,a3,a4,a5,a6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(16,plain,
product(a5,a10) = a2,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_05,theory(equality)]) ).
cnf(17,plain,
product(a2,a4) = a3,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_04,theory(equality)]) ).
cnf(20,plain,
product(a3,a2) = a1,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_03,theory(equality)]) ).
cnf(21,plain,
product(a4,a3) = a10,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,knot_10,theory(equality)]) ).
cnf(27,plain,
product(a2,X) = product(product(a3,X),product(a4,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_04,theory(equality)]) ).
cnf(28,plain,
product(a6,X) = product(product(a5,X),product(a4,X)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_06,theory(equality)]) ).
cnf(51,plain,
product(product(X,a1),a2) = product(product(X,a2),a3),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,knot_03,theory(equality)]) ).
cnf(70,plain,
product(product(a5,X),a10) = product(a2,product(X,a10)),
inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,16,theory(equality)]) ).
cnf(118,plain,
product(a2,a3) = product(a3,a10),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[27,involutory_quandle,theory(equality)]),21,theory(equality)]) ).
cnf(122,plain,
product(product(a3,a10),a3) = a2,
inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,118,theory(equality)]) ).
cnf(126,plain,
product(product(X,a1),a2) = product(product(X,a3),product(a3,a10)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_02,118,theory(equality)]),51,theory(equality)]) ).
cnf(140,plain,
product(a6,a3) = product(a2,product(a3,a10)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,21,theory(equality)]),70,theory(equality)]) ).
cnf(152,plain,
product(a7,a2) = a2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,140,theory(equality)]),knot_07,126,theory(equality)]) ).
cnf(157,plain,
a2 = a7,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[involutory_quandle_01,152,theory(equality)]),involutory_quandle,theory(equality)]) ).
cnf(160,plain,
a8 = a3,
inference('REWRITE',[status(thm)],[knot_08,17,157,theory(equality)]) ).
cnf(161,plain,
a10 = product(a3,a9),
inference('REWRITE',[status(thm)],[knot_09,160,theory(equality)]) ).
cnf(162,plain,
a9 = a10,
inference('REWRITE',[status(thm)],[knot_11,21,160,theory(equality)]) ).
cnf(166,plain,
a10 = product(a3,a10),
inference('REWRITE',[status(thm)],[161,162,theory(equality)]) ).
cnf(168,plain,
a4 = a2,
inference('REWRITE',[status(thm)],[122,knot_10,166,theory(equality)]) ).
cnf(169,plain,
a2 = a1,
inference('REWRITE',[status(thm)],[knot_04,20,168,theory(equality)]) ).
cnf(170,plain,
a3 = a1,
inference('REWRITE',[status(thm)],[knot_03,involutory_quandle,169,theory(equality)]) ).
cnf(171,plain,
a8 = a1,
inference('REWRITE',[status(thm)],[160,170,theory(equality)]) ).
cnf(172,plain,
a10 = product(a1,a10),
inference('REWRITE',[status(thm)],[166,170,theory(equality)]) ).
cnf(173,plain,
a5 = a10,
inference('REWRITE',[status(thm)],[knot_05,172,169,theory(equality)]) ).
cnf(174,plain,
a10 = a1,
inference('REWRITE',[status(thm)],[16,involutory_quandle,173,169,theory(equality)]) ).
cnf(175,plain,
a9 = a1,
inference('REWRITE',[status(thm)],[162,174,theory(equality)]) ).
cnf(176,plain,
a5 = a1,
inference('REWRITE',[status(thm)],[173,174,theory(equality)]) ).
cnf(179,plain,
a4 = a1,
inference('REWRITE',[status(thm)],[168,169,theory(equality)]) ).
cnf(180,plain,
a6 = a1,
inference('REWRITE',[status(thm)],[knot_06,involutory_quandle,169,176,168,theory(equality)]) ).
cnf(181,plain,
$false,
inference('REWRITE',[status(thm)],[goal,174,176,179,170,169,180,171,175,157,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : TOP049-1 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun May 29 07:56:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 *
% 0.22/0.49 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T07:56:11
% 0.22/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-05-29T07:56:11
% 0.42/0.59
% 0.42/0.59
% 0.42/0.59 #||
% 0.42/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.59 % SZS output start Refutation
% See solution above
% 0.42/0.60 ||#
% 0.42/0.60
% 0.42/0.60 ; Summary of computation:
% 0.42/0.60 ; 412 formulas have been input or derived (from 40 formulas).
% 0.42/0.60 ; 181 (44%) were retained. Of these,
% 0.42/0.60 ; 158 (87%) were simplified or subsumed later,
% 0.42/0.60 ; 23 (13%) are still being kept.
% 0.42/0.60 ;
% 0.42/0.60 ; Run time in seconds excluding printing time:
% 0.42/0.60 ; 0.002 2% Read assertion file (1 call)
% 0.42/0.60 ; 0.000 0% Assert (14 calls)
% 0.42/0.60 ; 0.012 12% Process new row (383 calls)
% 0.42/0.60 ; 0.001 1% Resolution (78 calls)
% 0.42/0.60 ; 0.005 5% Paramodulation (39 calls)
% 0.42/0.60 ; 0.020 21% Forward simplification (383 calls)
% 0.42/0.60 ; 0.016 16% Backward simplification (181 calls)
% 0.42/0.60 ; 0.016 16% Ordering (1,226 calls)
% 0.42/0.60 ; 0.000 0% Sortal reasoning (32 calls)
% 0.42/0.60 ; 0.000 0% Purity testing (1 call)
% 0.42/0.60 ; 0.025 26% Other
% 0.42/0.60 ; 0.097 Total
% 0.42/0.60 ; 0.098 Real time
% 0.42/0.60 ;
% 0.42/0.60 ; Term-hash-array has 506 terms in all.
% 0.42/0.60 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.42/0.60 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.42/0.60 ; Path-index has 74 entries (464 at peak, 532 added, 458 deleted).
% 0.42/0.60 ; Path-index has 113 nodes (331 at peak, 357 added, 244 deleted).
% 0.42/0.60 ; Trie-index has 74 entries (464 at peak, 532 added, 458 deleted).
% 0.42/0.60 ; Trie-index has 187 nodes (1,667 at peak, 1,878 added, 1,691 deleted).
% 0.42/0.60 ; Retrieved 2,652 generalization terms in 1,778 calls.
% 0.42/0.60 ; Retrieved 258 instance terms in 202 calls.
% 0.42/0.60 ; Retrieved 680 unifiable terms in 262 calls.
% 0.42/0.60 ;
% 0.42/0.60 ; The agenda of backward simplifiable rows to process has 26 entries:
% 0.42/0.60 ; 26 with value 0
% 0.42/0.60 ; The agenda of rows to process has 3 entries:
% 0.42/0.60 ; 3 with value 18
% 0.42/0.60 ; The agenda of input rows to give has 6 entries:
% 0.42/0.60 ; 6 with value 4
% 0.42/0.60 ; The agenda of rows to give has 13 entries:
% 0.42/0.60 ; 1 with value (4 5) 1 with value (4 15) 4 with value (4 24)
% 0.42/0.60 ; 1 with value (4 7) 3 with value (4 18) 2 with value (4 26)
% 0.42/0.60 ; 1 with value (4 8)
% 0.42/0.60 Evaluation took:
% 0.42/0.60 0.099 seconds of real time
% 0.42/0.60 0.085983 seconds of user run time
% 0.42/0.60 0.012971 seconds of system run time
% 0.42/0.60 0 calls to %EVAL
% 0.42/0.60 0 page faults and
% 0.42/0.60 6,678,328 bytes consed.
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T07:56:11
% 0.42/0.60 :PROOF-FOUND
% 0.42/0.60 *
%------------------------------------------------------------------------------