%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP424-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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 : Sat Jul 16 11:38:32 EDT 2022
% Result : Unsatisfiable 0.39s 0.62s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 2 RR)
% Number of literals : 19 ( 18 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(Z),Z))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(3,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(X),Z)))),multiply(Y,inverse(Z)))),inverse(Z)))),inverse(multiply(inverse(Z),Z))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(4,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(Z),Z))))) = multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(11,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(Z),U)))),multiply(Y,inverse(U)))),inverse(multiply(inverse(X),multiply(inverse(U),U))))),Z)),inverse(multiply(inverse(U),U))))),inverse(multiply(inverse(multiply(inverse(U),U)),multiply(inverse(U),U)))) = multiply(inverse(U),U),
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(14,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(Y),inverse(multiply(inverse(Z),Z)))),Z)))),multiply(X,inverse(Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,4,theory(equality)]) ).
cnf(15,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z))) = multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[4,4,theory(equality)]) ).
cnf(45,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U))))) = multiply(inverse(multiply(V,inverse(Y))),multiply(V,inverse(multiply(Z,inverse(U))))),
inference('PARAMODULATE',[status(thm)],[15,14,theory(equality)]) ).
cnf(54,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(Z))) = multiply(inverse(multiply(U,inverse(Y))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[45,single_axiom,theory(equality)]) ).
cnf(55,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),multiply(Z,inverse(U)))))),multiply(X,inverse(multiply(Z,inverse(U)))))),inverse(multiply(inverse(multiply(V,inverse(U))),multiply(V,inverse(U))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,54,theory(equality)]) ).
cnf(69,plain,
multiply(inverse(X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(Z))))) = multiply(inverse(X),inverse(multiply(inverse(multiply(U,inverse(Z))),multiply(U,inverse(Z))))),
inference('PARAMODULATE',[status(thm)],[55,14,theory(equality)]) ).
cnf(93,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(X),inverse(multiply(inverse(multiply(Z,inverse(multiply(inverse(U),U)))),multiply(Z,inverse(multiply(inverse(U),U)))))),
inference('PARAMODULATE',[status(thm)],[69,single_axiom,theory(equality)]) ).
cnf(111,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(X),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[93,93,theory(equality)]) ).
cnf(112,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),U))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,111,theory(equality)]) ).
cnf(134,plain,
multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),multiply(inverse(V),V))))),Y)),inverse(multiply(inverse(W),W))) = U,
inference('PARAMODULATE',[status(thm)],[112,112,theory(equality)]) ).
cnf(135,plain,
multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(multiply(inverse(Y),Y)),multiply(inverse(Y),Y)))) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[11,134,theory(equality)]) ).
cnf(136,plain,
multiply(inverse(X),X) = multiply(inverse(multiply(inverse(Y),Y)),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[111,135,theory(equality)]) ).
cnf(137,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[136,136,theory(equality)]) ).
cnf(138,plain,
$false,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,137,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP424-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 08:48:03 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 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-06-14T08:48:03
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-14T08:48:03
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 #||
% 0.39/0.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.62 % SZS output start Refutation
% See solution above
% 0.39/0.62 ||#
% 0.39/0.62
% 0.39/0.62 ; Summary of computation:
% 0.39/0.62 ; 592 formulas have been input or derived (from 16 formulas).
% 0.39/0.62 ; 138 (23%) were retained. Of these,
% 0.39/0.62 ; 59 (43%) were simplified or subsumed later,
% 0.39/0.62 ; 79 (57%) are still being kept.
% 0.39/0.62 ;
% 0.39/0.62 ; Run time in seconds excluding printing time:
% 0.39/0.62 ; 0.001 1% Read assertion file (1 call)
% 0.39/0.62 ; 0.000 0% Assert (2 calls)
% 0.39/0.62 ; 0.043 30% Process new row (551 calls)
% 0.39/0.62 ; 0.001 1% Resolution (30 calls)
% 0.39/0.62 ; 0.027 19% Paramodulation (15 calls)
% 0.39/0.62 ; 0.030 21% Forward simplification (343 calls)
% 0.39/0.62 ; 0.018 12% Backward simplification (138 calls)
% 0.39/0.62 ; 0.001 1% Ordering (966 calls)
% 0.39/0.62 ; 0.001 1% Sortal reasoning (32 calls)
% 0.39/0.62 ; 0.000 0% Purity testing (1 call)
% 0.39/0.62 ; 0.022 15% Other
% 0.39/0.62 ; 0.144 Total
% 0.39/0.62 ; 0.147 Real time
% 0.39/0.62 ;
% 0.39/0.62 ; Term-hash-array has 1,193 terms in all.
% 0.39/0.62 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.39/0.62 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.39/0.62 ; Path-index has 895 entries (1,043 at peak, 1,209 added, 314 deleted).
% 0.39/0.62 ; Path-index has 5,559 nodes (5,692 at peak, 5,692 added, 133 deleted).
% 0.39/0.62 ; Trie-index has 895 entries (1,043 at peak, 1,209 added, 314 deleted).
% 0.39/0.62 ; Trie-index has 10,061 nodes (11,864 at peak, 12,847 added, 2,786 deleted).
% 0.39/0.62 ; Retrieved 333 generalization terms in 2,884 calls.
% 0.39/0.62 ; Retrieved 599 instance terms in 139 calls.
% 0.39/0.62 ; Retrieved 3,905 unifiable terms in 224 calls.
% 0.39/0.62 ;
% 0.39/0.62 ; The agenda of rows to process has 36 entries:
% 0.39/0.62 ; 4 with value 31 3 with value 41 2 with value 47
% 0.39/0.62 ; 2 with value 37 4 with value 42 2 with value 48
% 0.39/0.62 ; 1 with value 38 4 with value 45 1 with value 49
% 0.39/0.62 ; 4 with value 39 2 with value 46 3 with value 50
% 0.39/0.62 ; 4 with value 40
% 0.39/0.62 ; The agenda of rows to give has 74 entries:
% 0.39/0.62 ; 1 with value (4 22) 1 with value (4 61) 1 with value (4 90)
% 0.39/0.62 ; 1 with value (4 33) 1 with value (4 62) 1 with value (4 92)
% 0.39/0.62 ; 2 with value (4 42) 1 with value (4 63) 2 with value (4 95)
% 0.39/0.62 ; 1 with value (4 43) 1 with value (4 65) 3 with value (4 97)
% 0.39/0.62 ; 1 with value (4 44) 1 with value (4 66) 1 with value (4 105)
% 0.39/0.62 ; 1 with value (4 45) 1 with value (4 69) 1 with value (4 109)
% 0.39/0.62 ; 1 with value (4 49) 3 with value (4 70) 1 with value (4 110)
% 0.39/0.62 ; 1 with value (4 50) 1 with value (4 71) 2 with value (4 112)
% 0.39/0.62 ; 3 with value (4 51) 3 with value (4 72) 1 with value (4 114)
% 0.39/0.62 ; 2 with value (4 53) 1 with value (4 76) 1 with value (4 125)
% 0.39/0.62 ; 3 with value (4 54) 2 with value (4 81) 1 with value (4 129)
% 0.39/0.62 ; 2 with value (4 55) 4 with value (4 82) 1 with value (4 137)
% 0.39/0.62 ; 1 with value (4 56) 1 with value (4 83) 1 with value (4 141)
% 0.39/0.62 ; 1 with value (4 57) 3 with value (4 85) 2 with value (4 144)
% 0.39/0.62 ; 1 with value (4 58) 1 with value (4 86) 1 with value (4 148)
% 0.39/0.62 ; 1 with value (4 59) 2 with value (4 87) 1 with value (4 159)
% 0.39/0.62 ; 1 with value (4 60) 1 with value (4 89) 1 with value (4 166)
% 0.39/0.62 Evaluation took:
% 0.39/0.62 0.147 seconds of real time
% 0.39/0.62 0.135134 seconds of user run time
% 0.39/0.62 0.012048 seconds of system run time
% 0.39/0.62 0 calls to %EVAL
% 0.39/0.62 0 page faults and
% 0.39/0.62 12,189,960 bytes consed.
% 0.39/0.62 :PROOF-FOUND
% 0.39/0.62 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T08:48:03
% 0.39/0.62 :PROOF-FOUND
% 0.39/0.62 *
%------------------------------------------------------------------------------