%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP482-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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.17s 0.48s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 16 ( 15 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(double_divide(X,double_divide(Y,identity)),double_divide(double_divide(Z,double_divide(U,double_divide(U,identity))),double_divide(X,identity))),Y) = 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_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(6,plain,
multiply(X,Y) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
inverse(inverse(a2)) != a2,
inference('REWRITE',[status(thm)],[prove_these_axioms_2,inverse,6,theory(equality)]) ).
cnf(8,plain,
double_divide(double_divide(double_divide(X,inverse(Y)),double_divide(inverse(Z),inverse(X))),Y) = Z,
inference('REWRITE',[status(thm)],[single_axiom,identity,inverse,theory(equality)]) ).
cnf(10,plain,
double_divide(inverse(double_divide(inverse(X),inverse(Y))),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(13,plain,
double_divide(inverse(identity),inverse(X)) = X,
inference('PARAMODULATE',[status(thm)],[10,identity,theory(equality)]) ).
cnf(17,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,13,theory(equality)]) ).
cnf(19,plain,
double_divide(identity,inverse(X)) = X,
inference('REWRITE',[status(thm)],[13,17,theory(equality)]) ).
cnf(21,plain,
double_divide(inverse(X),X) = identity,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,17,theory(equality)]),19,theory(equality)]) ).
cnf(22,plain,
double_divide(identity,X) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,21,theory(equality)]),17,theory(equality)]) ).
cnf(23,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[19,22,theory(equality)]) ).
cnf(25,plain,
$false,
inference('REWRITE',[status(thm)],[7,23,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP482-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.12/0.32 % Computer : n008.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 13 06:25:37 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.17/0.43 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44 *
% 0.17/0.44 *
% 0.17/0.45 #<PACKAGE "SNARK-USER">
% 0.17/0.45 *
% 0.17/0.45 SNARK-TPTP-OPTIONS
% 0.17/0.45 *
% 0.17/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.45 (USE-FACTORING :POS)
% 0.17/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.45 *
% 0.17/0.45 "."
% 0.17/0.45 *
% 0.17/0.45 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:25:37
% 0.17/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-06-13T06:25:37
% 0.17/0.46
% 0.17/0.48 ; Recognized possible right inverse assertion (= |identity| (|double_divide| ?X (|inverse| ?X))).
% 0.17/0.48
% 0.17/0.48 #||
% 0.17/0.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.48 % SZS output start Refutation
% See solution above
% 0.17/0.49 ||#
% 0.17/0.49
% 0.17/0.49 ; Summary of computation:
% 0.17/0.49 ; 46 formulas have been input or derived (from 11 formulas).
% 0.17/0.49 ; 25 (54%) were retained. Of these,
% 0.17/0.49 ; 13 (52%) were simplified or subsumed later,
% 0.17/0.49 ; 12 (48%) are still being kept.
% 0.17/0.49 ;
% 0.17/0.49 ; Run time in seconds excluding printing time:
% 0.17/0.49 ; 0.001 3% Read assertion file (1 call)
% 0.17/0.49 ; 0.001 3% Assert (5 calls)
% 0.17/0.49 ; 0.005 16% Process new row (45 calls)
% 0.17/0.49 ; 0.000 0% Resolution (20 calls)
% 0.17/0.49 ; 0.003 9% Paramodulation (10 calls)
% 0.17/0.49 ; 0.001 3% Forward simplification (43 calls)
% 0.17/0.49 ; 0.000 0% Backward simplification (25 calls)
% 0.17/0.49 ; 0.000 0% Ordering (89 calls)
% 0.17/0.49 ; 0.000 0% Sortal reasoning (32 calls)
% 0.17/0.49 ; 0.000 0% Purity testing (1 call)
% 0.17/0.49 ; 0.021 66% Other
% 0.17/0.49 ; 0.032 Total
% 0.17/0.49 ; 0.033 Real time
% 0.17/0.49 ;
% 0.17/0.49 ; Term-hash-array has 91 terms in all.
% 0.17/0.49 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.17/0.49 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.17/0.49 ; Path-index has 42 entries (58 at peak, 99 added, 57 deleted).
% 0.17/0.49 ; Path-index has 273 nodes (288 at peak, 368 added, 95 deleted).
% 0.17/0.49 ; Trie-index has 42 entries (58 at peak, 99 added, 57 deleted).
% 0.17/0.49 ; Trie-index has 183 nodes (261 at peak, 455 added, 272 deleted).
% 0.17/0.49 ; Retrieved 46 generalization terms in 149 calls.
% 0.17/0.49 ; Retrieved 43 instance terms in 24 calls.
% 0.17/0.49 ; Retrieved 77 unifiable terms in 61 calls.
% 0.17/0.49 ;
% 0.17/0.49 ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.17/0.49 ; 1 with value 0
% 0.17/0.49 ; The agenda of rows to give has 5 entries:
% 0.17/0.49 ; 1 with value (4 10) 1 with value (4 17) 1 with value (4 28)
% 0.17/0.49 ; 1 with value (4 13) 1 with value (4 20)
% 0.17/0.49 Evaluation took:
% 0.17/0.49 0.034 seconds of real time
% 0.17/0.49 0.02702 seconds of user run time
% 0.17/0.49 0.006974 seconds of system run time
% 0.17/0.49 0 calls to %EVAL
% 0.17/0.49 0 page faults and
% 0.17/0.49 2,525,664 bytes consed.
% 0.17/0.49 :PROOF-FOUND
% 0.17/0.49 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T06:25:37
% 0.17/0.49 :PROOF-FOUND
% 0.17/0.49 *
%------------------------------------------------------------------------------