%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG240-1 : TPTP v8.1.0. Released v4.0.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 14 18:00:22 EDT 2022
% Result : Unsatisfiable 2.53s 2.75s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 2 RR)
% Number of literals : 42 ( 41 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,mult(Y,Z)) = mult(mult(X,Y),mult(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
mult(mult(X,Y),Z) = mult(mult(X,Z),mult(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(mult(mult(X,Y),mult(Z,U)),mult(mult(mult(X,Y),mult(Z,U)),mult(mult(X,Z),mult(Y,U)))) = mult(mult(X,Z),mult(Y,U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
mult(mult(mult(mult(X,Y),mult(Z,U)),mult(mult(X,Z),mult(Y,U))),mult(mult(X,Z),mult(Y,U))) = mult(mult(X,Y),mult(Z,U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(goals,negated_conjecture,
mult(mult(mult(a,b),mult(c,d)),mult(mult(a,c),mult(b,d))) != mult(mult(mult(a,c),mult(b,d)),mult(mult(a,b),mult(c,d))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(11,plain,
mult(mult(X,Y),mult(Z,mult(X,U))) = mult(mult(mult(X,Y),Z),mult(X,mult(Y,U))),
inference('PARAMODULATE',[status(thm)],[c01,c01,theory(equality)]) ).
cnf(12,plain,
mult(X,mult(Y,Y)) = mult(mult(X,X),Y),
inference('PARAMODULATE',[status(thm)],[c01,c02,theory(equality)]) ).
cnf(25,plain,
mult(mult(mult(X,Y),Z),mult(U,Y)) = mult(mult(mult(X,U),Y),mult(Z,mult(U,Y))),
inference('PARAMODULATE',[status(thm)],[c02,c02,theory(equality)]) ).
cnf(27,plain,
mult(mult(X,Y),mult(Z,U)) = mult(mult(mult(X,Z),mult(X,U)),mult(Y,mult(Z,U))),
inference('PARAMODULATE',[status(thm)],[c02,c01,theory(equality)]) ).
cnf(29,plain,
mult(mult(X,Y),mult(Z,U)) = mult(mult(X,mult(Z,U)),mult(mult(Y,Z),mult(Y,U))),
inference('PARAMODULATE',[status(thm)],[c02,c01,theory(equality)]) ).
cnf(36,plain,
mult(mult(mult(X,Y),Z),mult(mult(mult(X,Y),Z),mult(mult(X,Y),mult(Z,Z)))) = mult(mult(X,Y),mult(Z,Z)),
inference('PARAMODULATE',[status(thm)],[c03,c02,theory(equality)]) ).
cnf(37,plain,
mult(mult(mult(X,mult(Y,Z)),mult(mult(X,X),mult(Y,Z))),mult(X,mult(Y,Z))) = mult(X,mult(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c03,c01,theory(equality)]),25,theory(equality)]) ).
cnf(47,plain,
mult(mult(mult(X,Y),mult(Z,U)),mult(mult(mult(mult(X,Y),mult(Z,U)),mult(mult(X,Z),mult(Y,U))),V)) = mult(mult(mult(X,Z),mult(Y,U)),mult(mult(mult(X,Y),mult(Z,U)),V)),
inference('PARAMODULATE',[status(thm)],[c01,c03,theory(equality)]) ).
cnf(75,plain,
mult(mult(mult(X,Y),Z),mult(mult(mult(X,Y),mult(Z,Z)),mult(mult(X,Y),Z))) = mult(mult(X,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c04,c02,theory(equality)]),11,theory(equality)]) ).
cnf(105,plain,
mult(mult(mult(mult(X,Y),mult(Z,U)),mult(mult(X,Z),mult(Y,U))),mult(mult(mult(X,Z),mult(Y,U)),V)) = mult(mult(mult(X,Z),mult(Y,U)),mult(mult(mult(X,Y),mult(Z,U)),V)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c01,c04,theory(equality)]),47,theory(equality)]) ).
cnf(125,plain,
mult(X,mult(Y,mult(Z,Z))) = mult(mult(X,X),mult(Y,Z)),
inference('PARAMODULATE',[status(thm)],[12,c01,theory(equality)]) ).
cnf(126,plain,
mult(X,mult(mult(Y,Y),Z)) = mult(mult(X,X),mult(Y,Z)),
inference('PARAMODULATE',[status(thm)],[12,c02,theory(equality)]) ).
cnf(127,plain,
mult(mult(X,Y),mult(Z,Z)) = mult(mult(X,mult(Y,Y)),Z),
inference('PARAMODULATE',[status(thm)],[12,c01,theory(equality)]) ).
cnf(150,plain,
mult(mult(X,mult(mult(Y,Z),mult(Y,Z))),mult(mult(X,mult(mult(Y,Z),mult(Y,Z))),mult(mult(X,Y),mult(X,Z)))) = mult(mult(X,Y),mult(X,Z)),
inference('PARAMODULATE',[status(thm)],[c03,12,theory(equality)]) ).
cnf(184,plain,
mult(X,mult(Y,mult(Z,mult(U,U)))) = mult(mult(X,X),mult(Y,mult(Z,U))),
inference('PARAMODULATE',[status(thm)],[125,c01,theory(equality)]) ).
cnf(185,plain,
mult(mult(mult(mult(X,Y),Z),mult(mult(X,Y),Z)),mult(mult(X,Y),Z)) = mult(mult(X,Y),mult(Z,Z)),
inference('REWRITE',[status(thm)],[36,c02,184,theory(equality)]) ).
cnf(209,plain,
mult(X,mult(mult(Y,Y),mult(mult(Z,U),mult(Z,U)))) = mult(mult(X,X),mult(Y,mult(Z,mult(U,U)))),
inference('PARAMODULATE',[status(thm)],[125,125,theory(equality)]) ).
cnf(216,plain,
mult(mult(mult(X,Y),mult(X,Z)),mult(mult(mult(X,Y),mult(X,Z)),mult(X,mult(Y,mult(Z,Z))))) = mult(X,mult(Y,mult(Z,Z))),
inference('PARAMODULATE',[status(thm)],[c03,125,theory(equality)]) ).
cnf(226,plain,
mult(X,mult(mult(mult(Y,Z),mult(U,V)),mult(mult(mult(Y,U),mult(Z,V)),mult(mult(Y,Z),mult(U,V))))) = mult(mult(X,X),mult(mult(Y,U),mult(Z,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[125,c04,theory(equality)]),105,theory(equality)]) ).
cnf(274,plain,
mult(mult(X,Y),X) = mult(X,mult(mult(Y,Y),X)),
inference('PARAMODULATE',[status(thm)],[c02,126,theory(equality)]) ).
cnf(275,plain,
mult(X,mult(Y,mult(Z,Z))) = mult(X,mult(mult(Y,Y),Z)),
inference('PARAMODULATE',[status(thm)],[125,126,theory(equality)]) ).
cnf(283,plain,
mult(X,mult(mult(Y,mult(Z,Z)),U)) = mult(mult(X,X),mult(mult(Y,Z),U)),
inference('PARAMODULATE',[status(thm)],[126,c01,theory(equality)]) ).
cnf(285,plain,
mult(mult(X,Y),mult(Z,Z)) = mult(mult(X,Y),Z),
inference('REWRITE',[status(thm)],[75,185,c02,283,theory(equality)]) ).
cnf(287,plain,
mult(X,mult(mult(Y,Y),mult(Z,U))) = mult(mult(X,X),mult(Y,mult(Z,mult(U,U)))),
inference('REWRITE',[status(thm)],[209,285,theory(equality)]) ).
cnf(296,plain,
mult(mult(X,Y),Z) = mult(mult(X,mult(Y,Y)),Z),
inference('REWRITE',[status(thm)],[127,285,theory(equality)]) ).
cnf(298,plain,
mult(mult(X,mult(Y,Z)),mult(mult(X,X),mult(Y,Z))) = mult(mult(X,Y),mult(X,Z)),
inference('REWRITE',[status(thm)],[150,29,296,theory(equality)]) ).
cnf(299,plain,
mult(mult(X,X),mult(Y,Z)) = mult(X,mult(Y,Z)),
inference('REWRITE',[status(thm)],[37,27,298,theory(equality)]) ).
cnf(315,plain,
mult(X,mult(mult(mult(Y,Z),mult(U,V)),mult(mult(mult(Y,U),mult(Z,V)),mult(mult(Y,Z),mult(U,V))))) = mult(X,mult(mult(Y,U),mult(Z,V))),
inference('REWRITE',[status(thm)],[226,299,theory(equality)]) ).
cnf(322,plain,
mult(X,mult(Y,mult(Z,U))) = mult(X,mult(Y,mult(Z,mult(U,U)))),
inference('REWRITE',[status(thm)],[287,299,theory(equality)]) ).
cnf(346,plain,
mult(X,mult(Y,Z)) = mult(X,mult(Y,mult(Z,Z))),
inference('REWRITE',[status(thm)],[216,299,27,322,theory(equality)]) ).
cnf(350,plain,
mult(X,mult(Y,Z)) = mult(X,mult(mult(Y,Y),Z)),
inference('REWRITE',[status(thm)],[275,346,theory(equality)]) ).
cnf(351,plain,
mult(mult(X,Y),X) = mult(X,mult(Y,X)),
inference('REWRITE',[status(thm)],[274,350,theory(equality)]) ).
cnf(353,plain,
mult(mult(X,mult(X,Y)),X) = mult(X,mult(X,mult(Y,X))),
inference('PARAMODULATE',[status(thm)],[351,351,theory(equality)]) ).
cnf(404,plain,
mult(mult(X,Y),mult(Z,U)) = mult(mult(mult(mult(X,Z),mult(Y,U)),mult(mult(X,Y),mult(Z,U))),mult(mult(X,Z),mult(Y,U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[351,c04,theory(equality)]),315,c03,theory(equality)]) ).
cnf(405,plain,
mult(mult(mult(X,Y),mult(Z,U)),mult(mult(mult(X,Z),mult(Y,U)),mult(mult(X,Y),mult(Z,U)))) = mult(mult(X,Z),mult(Y,U)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[351,c03,theory(equality)]),c04,404,theory(equality)]) ).
cnf(577,plain,
mult(mult(mult(X,Y),mult(Z,U)),mult(mult(X,Z),mult(Y,U))) = mult(mult(mult(X,Z),mult(Y,U)),mult(mult(X,Y),mult(Z,U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[353,c03,theory(equality)]),405,theory(equality)]) ).
cnf(578,plain,
$false,
inference('REWRITE',[status(thm)],[goals,577,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG240-1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n018.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 Jun 9 04:26:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T04:26:08
% 0.21/0.48 ; 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-06-09T04:26:08
% 2.53/2.75
% 2.53/2.75
% 2.53/2.75 #||
% 2.53/2.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/2.75 % SZS output start Refutation
% See solution above
% 2.53/2.75 ||#
% 2.53/2.75
% 2.53/2.75 ; Summary of computation:
% 2.53/2.75 ; 1900 formulas have been input or derived (from 22 formulas).
% 2.53/2.75 ; 578 (30%) were retained. Of these,
% 2.53/2.75 ; 225 (39%) were simplified or subsumed later,
% 2.53/2.75 ; 353 (61%) are still being kept.
% 2.53/2.75 ;
% 2.53/2.75 ; Run time in seconds excluding printing time:
% 2.53/2.75 ; 0.002 0% Read assertion file (1 call)
% 2.53/2.75 ; 0.000 0% Assert (5 calls)
% 2.53/2.75 ; 0.076 3% Process new row (1,861 calls)
% 2.53/2.75 ; 0.003 0% Resolution (42 calls)
% 2.53/2.75 ; 0.033 1% Paramodulation (21 calls)
% 2.53/2.75 ; 0.388 17% Forward simplification (1,758 calls)
% 2.53/2.75 ; 0.293 13% Backward simplification (578 calls)
% 2.53/2.75 ; 1.443 64% Ordering (80,869 calls)
% 2.53/2.75 ; 0.001 0% Sortal reasoning (32 calls)
% 2.53/2.75 ; 0.000 0% Purity testing (1 call)
% 2.53/2.75 ; 0.032 1% Other
% 2.53/2.75 ; 2.271 Total
% 2.53/2.75 ; 2.275 Real time
% 2.53/2.75 ;
% 2.53/2.75 ; Term-hash-array has 1,831 terms in all.
% 2.53/2.75 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 2.53/2.75 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 2.53/2.75 ; Path-index has 1,270 entries (1,271 at peak, 1,905 added, 635 deleted).
% 2.53/2.75 ; Path-index has 1,377 nodes (1,377 at peak, 1,377 added, 0 deleted).
% 2.53/2.75 ; Trie-index has 1,270 entries (1,271 at peak, 1,905 added, 635 deleted).
% 2.53/2.75 ; Trie-index has 10,437 nodes (10,446 at peak, 14,113 added, 3,676 deleted).
% 2.53/2.75 ; Retrieved 189,245 generalization terms in 23,569 calls.
% 2.53/2.75 ; Retrieved 95,630 instance terms in 979 calls.
% 2.53/2.75 ; Retrieved 13,674 unifiable terms in 166 calls.
% 2.53/2.75 ;
% 2.53/2.75 ; The agenda of rows to process has 31 entries:
% 2.53/2.75 ; 3 with value 58 8 with value 67 2 with value 107
% 2.53/2.75 ; 16 with value 59 2 with value 75
% 2.53/2.75 ; The agenda of rows to give has 335 entries:
% 2.53/2.75 ; 1 with value (4 23) 32 with value (4 34) 2 with value (4 47)
% 2.53/2.75 ; 16 with value (4 24) 8 with value (4 35) 34 with value (4 49)
% 2.53/2.75 ; 12 with value (4 25) 8 with value (4 36) 49 with value (4 50)
% 2.53/2.75 ; 12 with value (4 26) 4 with value (4 37) 2 with value (4 52)
% 2.53/2.75 ; 8 with value (4 27) 6 with value (4 39) 1 with value (4 56)
% 2.53/2.75 ; 11 with value (4 28) 3 with value (4 40) 19 with value (4 58)
% 2.53/2.75 ; 10 with value (4 29) 16 with value (4 41) 2 with value (4 62)
% 2.53/2.75 ; 14 with value (4 30) 4 with value (4 42) 4 with value (4 79)
% 2.53/2.75 ; 10 with value (4 31) 6 with value (4 44) 4 with value (4 87)
% 2.53/2.75 ; 8 with value (4 32) 1 with value (4 45) 16 with value (4 88)
% 2.53/2.75 ; 4 with value (4 33) 8 with value (4 46)
% 2.53/2.75 Evaluation took:
% 2.53/2.75 2.275 seconds of real time
% 2.53/2.75 2.153436 seconds of user run time
% 2.53/2.75 0.122066 seconds of system run time
% 2.53/2.75 [Run times include 0.055 seconds GC run time.]
% 2.53/2.75 0 calls to %EVAL
% 2.53/2.75 0 page faults and
% 2.53/2.75 172,037,216 bytes consed.
% 2.53/2.75 :PROOF-FOUND
% 2.53/2.75 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T04:26:10
% 2.53/2.75 :PROOF-FOUND
% 2.53/2.75 *
%------------------------------------------------------------------------------