%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP068-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:35:59 EDT 2022
% Result : Unsatisfiable 0.37s 0.54s
% Output : Refutation 0.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 26 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(divide(divide(identity,Y),Z),divide(divide(divide(X,X),X),Z))) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(identity,Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(identity,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(identity,axiom,
identity = divide(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != identity
| multiply(identity,a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
divide(X,divide(divide(inverse(Y),Z),divide(inverse(X),Z))) = Y,
inference('REWRITE',[status(thm)],[single_axiom,identity,inverse,theory(equality)]) ).
cnf(7,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(8,plain,
( inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,identity,7,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(X,identity) = X,
inference('PARAMODULATE',[status(thm)],[6,identity,theory(equality)]) ).
cnf(12,plain,
divide(X,divide(inverse(Y),inverse(X))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,identity,theory(equality)]),10,theory(equality)]) ).
cnf(13,plain,
inverse(divide(divide(inverse(X),Y),inverse(Y))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[inverse,6,theory(equality)]),inverse,9,theory(equality)]) ).
cnf(17,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[inverse,12,theory(equality)]),10,9,theory(equality)]) ).
cnf(20,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[8,17,theory(equality)]) ).
cnf(22,plain,
divide(X,divide(divide(inverse(Y),divide(inverse(Z),X)),Z)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,12,theory(equality)]),17,theory(equality)]) ).
cnf(24,plain,
divide(X,divide(Y,inverse(X))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[12,17,theory(equality)]) ).
cnf(29,plain,
inverse(X) = divide(divide(inverse(X),Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[17,13,theory(equality)]) ).
cnf(32,plain,
X = divide(divide(X,Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[29,17,theory(equality)]) ).
cnf(33,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[24,32,theory(equality)]) ).
cnf(34,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[20,33,theory(equality)]) ).
cnf(36,plain,
X = divide(divide(X,divide(Y,Z)),divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[32,33,theory(equality)]) ).
cnf(47,plain,
divide(X,divide(divide(Y,divide(inverse(Z),X)),Z)) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[22,17,theory(equality)]) ).
cnf(55,plain,
divide(X,divide(Y,Z)) = divide(divide(X,inverse(Z)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47,36,theory(equality)]),33,theory(equality)]) ).
cnf(56,plain,
$false,
inference('REWRITE',[status(thm)],[34,55,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP068-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n013.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 : Tue Jun 14 10:43:44 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.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:43:44
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-14T10:43:44
% 0.37/0.54
% 0.37/0.54
% 0.37/0.54 #||
% 0.37/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.54 % SZS output start Refutation
% See solution above
% 0.37/0.54 ||#
% 0.37/0.54
% 0.37/0.54 ; Summary of computation:
% 0.37/0.54 ; 374 formulas have been input or derived (from 29 formulas).
% 0.37/0.54 ; 56 (15%) were retained. Of these,
% 0.37/0.54 ; 36 (64%) were simplified or subsumed later,
% 0.37/0.54 ; 20 (36%) are still being kept.
% 0.37/0.54 ;
% 0.37/0.54 ; Run time in seconds excluding printing time:
% 0.37/0.54 ; 0.001 2% Read assertion file (1 call)
% 0.37/0.54 ; 0.000 0% Assert (5 calls)
% 0.37/0.54 ; 0.008 14% Process new row (354 calls)
% 0.37/0.54 ; 0.000 0% Resolution (56 calls)
% 0.37/0.54 ; 0.011 19% Paramodulation (28 calls)
% 0.37/0.54 ; 0.000 0% Condensing (2 calls)
% 0.37/0.54 ; 0.001 2% Forward subsumption (2 calls)
% 0.37/0.54 ; 0.000 0% Backward subsumption (2 calls)
% 0.37/0.54 ; 0.007 12% Forward simplification (286 calls)
% 0.37/0.54 ; 0.003 5% Backward simplification (56 calls)
% 0.37/0.54 ; 0.002 3% Ordering (611 calls)
% 0.37/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.37/0.54 ; 0.000 0% Purity testing (1 call)
% 0.37/0.54 ; 0.025 43% Other
% 0.37/0.54 ; 0.058 Total
% 0.37/0.54 ; 0.062 Real time
% 0.37/0.54 ;
% 0.37/0.54 ; Term-hash-array has 213 terms in all.
% 0.37/0.54 ; Feature-vector-row-index has 0 entries (1 at peak, 2 added, 2 deleted).
% 0.37/0.54 ; Feature-vector-row-index has 1 node (26 at peak, 46 added, 45 deleted).
% 0.37/0.54 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.37/0.54 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.37/0.54 ; Path-index has 65 entries (126 at peak, 248 added, 183 deleted).
% 0.37/0.54 ; Path-index has 292 nodes (357 at peak, 520 added, 228 deleted).
% 0.37/0.54 ; Trie-index has 65 entries (126 at peak, 248 added, 183 deleted).
% 0.37/0.54 ; Trie-index has 222 nodes (445 at peak, 878 added, 656 deleted).
% 0.37/0.54 ; Retrieved 962 generalization terms in 1,644 calls.
% 0.37/0.54 ; Retrieved 127 instance terms in 55 calls.
% 0.37/0.54 ; Retrieved 850 unifiable terms in 209 calls.
% 0.37/0.54 ;
% 0.37/0.55 ; The agenda of backward simplifiable rows to process has 4 entries:
% 0.37/0.55 ; 4 with value 0
% 0.37/0.55 ; The agenda of rows to process has 14 entries:
% 0.37/0.55 ; 5 with value 26 1 with value 29 2 with value 32
% 0.37/0.55 ; 3 with value 27 1 with value 31 1 with value 33
% 0.37/0.55 ; 1 with value 28
% 0.37/0.55 ; The agenda of rows to give has 7 entries:
% 0.37/0.55 ; 1 with value (4 22) 1 with value (4 24) 1 with value (4 25)
% 0.37/0.55 ; 4 with value (4 23)
% 0.37/0.55 Evaluation took:
% 0.37/0.55 0.062 seconds of real time
% 0.37/0.55 0.054802 seconds of user run time
% 0.37/0.55 0.007253 seconds of system run time
% 0.37/0.55 0 calls to %EVAL
% 0.37/0.55 0 page faults and
% 0.37/0.55 4,606,744 bytes consed.
% 0.37/0.55 :PROOF-FOUND
% 0.37/0.55 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T10:43:44
% 0.37/0.55 :PROOF-FOUND
% 0.37/0.55 *
%------------------------------------------------------------------------------