%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP484-1 : TPTP v8.1.0. Released v2.6.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 : Sat Jul 16 11:39:05 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 13 ( 12 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X,double_divide(double_divide(double_divide(X,Y),Z),double_divide(Y,identity))),double_divide(identity,identity)) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = double_divide(double_divide(Y,X),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = double_divide(X,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = double_divide(X,inverse(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
inverse(identity) != identity,
inference('REWRITE',[status(thm)],[prove_these_axioms_1,identity,6,theory(equality)]) ).
cnf(8,plain,
double_divide(double_divide(X,double_divide(double_divide(double_divide(X,Y),Z),inverse(Y))),inverse(identity)) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
double_divide(double_divide(X,double_divide(identity,inverse(Y))),inverse(identity)) = inverse(double_divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]) ).
cnf(10,plain,
double_divide(double_divide(X,double_divide(double_divide(inverse(X),Y),inverse(identity))),inverse(identity)) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(16,plain,
double_divide(inverse(X),inverse(identity)) = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(21,plain,
double_divide(double_divide(X,inverse(inverse(inverse(X)))),inverse(identity)) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,inverse,theory(equality)]),16,theory(equality)]) ).
cnf(23,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,16,theory(equality)]),7,21,16,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP484-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 11:34:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T11:34:57
% 0.20/0.49 ; 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-13T11:34:57
% 0.20/0.50
% 0.20/0.52 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 36 formulas have been input or derived (from 9 formulas).
% 0.20/0.52 ; 23 (64%) were retained. Of these,
% 0.20/0.52 ; 3 (13%) were simplified or subsumed later,
% 0.20/0.52 ; 20 (87%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.001 3% Read assertion file (1 call)
% 0.20/0.52 ; 0.001 3% Assert (5 calls)
% 0.20/0.52 ; 0.004 13% Process new row (32 calls)
% 0.20/0.52 ; 0.000 0% Resolution (16 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (8 calls)
% 0.20/0.52 ; 0.002 6% Forward simplification (32 calls)
% 0.20/0.52 ; 0.001 3% Backward simplification (23 calls)
% 0.20/0.52 ; 0.000 0% Ordering (86 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.000 0% Purity testing (1 call)
% 0.20/0.52 ; 0.022 71% Other
% 0.20/0.52 ; 0.031 Total
% 0.20/0.52 ; 0.033 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 96 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.52 ; Path-index has 87 entries (87 at peak, 103 added, 16 deleted).
% 0.20/0.52 ; Path-index has 364 nodes (364 at peak, 403 added, 39 deleted).
% 0.20/0.52 ; Trie-index has 87 entries (87 at peak, 103 added, 16 deleted).
% 0.20/0.52 ; Trie-index has 476 nodes (476 at peak, 548 added, 72 deleted).
% 0.20/0.52 ; Retrieved 53 generalization terms in 120 calls.
% 0.20/0.52 ; Retrieved 26 instance terms in 22 calls.
% 0.20/0.52 ; Retrieved 75 unifiable terms in 56 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 4 entries:
% 0.20/0.52 ; 2 with value 23 1 with value 28 1 with value 31
% 0.20/0.52 ; The agenda of rows to give has 11 entries:
% 0.20/0.52 ; 1 with value (4 19) 1 with value (4 23) 1 with value (4 28)
% 0.20/0.52 ; 2 with value (4 21) 2 with value (4 27) 2 with value (4 31)
% 0.20/0.52 ; 2 with value (4 22)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.033 seconds of real time
% 0.20/0.52 0.029855 seconds of user run time
% 0.20/0.52 0.003053 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 2,419,512 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T11:34:57
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------