TSTP Solution File: GRP095-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP095-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:36:07 EDT 2022
% Result : Unsatisfiable 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 32 ( 29 unt; 0 nHn; 8 RR)
% Number of literals : 38 ( 37 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,X),divide(divide(divide(Y,X),Z),Y)) = Z,
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) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(6,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(7,plain,
( inverse(inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,inverse,identity,6,theory(equality)]) ).
cnf(8,plain,
divide(inverse(X),divide(divide(divide(Y,X),Z),Y)) = Z,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(9,plain,
identity = inverse(identity),
inference('PARAMODULATE',[status(thm)],[identity,inverse,theory(equality)]) ).
cnf(10,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(11,plain,
divide(inverse(X),divide(inverse(Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,identity,theory(equality)]),inverse,theory(equality)]) ).
cnf(14,plain,
inverse(divide(divide(divide(X,identity),Y),X)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,9,theory(equality)]),inverse,theory(equality)]) ).
cnf(15,plain,
inverse(inverse(X)) = divide(X,identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]),inverse,theory(equality)]) ).
cnf(16,plain,
inverse(divide(divide(inverse(inverse(X)),Y),X)) = Y,
inference('REWRITE',[status(thm)],[14,15,theory(equality)]) ).
cnf(18,plain,
inverse(inverse(inverse(X))) = inverse(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,9,theory(equality)]),inverse,15,theory(equality)]) ).
cnf(22,plain,
divide(X,Y) = divide(inverse(inverse(X)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,18,theory(equality)]),10,theory(equality)]) ).
cnf(25,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[16,22,theory(equality)]) ).
cnf(26,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,identity,theory(equality)]),15,22,theory(equality)]) ).
cnf(28,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[7,26,theory(equality)]) ).
cnf(29,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,10,theory(equality)]),26,theory(equality)]) ).
cnf(32,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[10,26,theory(equality)]) ).
cnf(33,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(divide(c3,inverse(b3)),inverse(a3)),
inference('REWRITE',[status(thm)],[28,32,theory(equality)]) ).
cnf(35,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[10,26,theory(equality)]) ).
cnf(38,plain,
divide(inverse(X),divide(Y,Z)) = divide(divide(Z,X),Y),
inference('PARAMODULATE',[status(thm)],[8,29,theory(equality)]) ).
cnf(40,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[33,26,38,theory(equality)]) ).
cnf(41,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('PARAMODULATE',[status(thm)],[26,25,theory(equality)]) ).
cnf(43,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[41,29,theory(equality)]) ).
cnf(47,plain,
divide(c3,divide(inverse(a3),b3)) != divide(b3,divide(inverse(a3),c3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[40,32,theory(equality)]),43,theory(equality)]) ).
cnf(48,plain,
divide(divide(X,Y),Z) = divide(inverse(Z),divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[35,43,theory(equality)]) ).
cnf(49,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('REWRITE',[status(thm)],[38,48,theory(equality)]) ).
cnf(60,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,49,theory(equality)]),43,theory(equality)]) ).
cnf(61,plain,
$false,
inference('REWRITE',[status(thm)],[47,60,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP095-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.14 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 12:29:16 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T12:29:16
% 0.21/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T12:29:16
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 #||
% 0.21/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.55 % SZS output start Refutation
% See solution above
% 0.21/0.56 ||#
% 0.21/0.56
% 0.21/0.56 ; Summary of computation:
% 0.21/0.56 ; 344 formulas have been input or derived (from 27 formulas).
% 0.21/0.56 ; 61 (18%) were retained. Of these,
% 0.21/0.56 ; 38 (62%) were simplified or subsumed later,
% 0.21/0.56 ; 23 (38%) are still being kept.
% 0.21/0.56 ;
% 0.21/0.56 ; Run time in seconds excluding printing time:
% 0.21/0.56 ; 0.002 3% Read assertion file (1 call)
% 0.21/0.56 ; 0.000 0% Assert (5 calls)
% 0.21/0.56 ; 0.003 5% Process new row (312 calls)
% 0.21/0.56 ; 0.002 3% Resolution (52 calls)
% 0.21/0.56 ; 0.007 12% Paramodulation (26 calls)
% 0.21/0.56 ; 0.000 0% Condensing (3 calls)
% 0.21/0.56 ; 0.000 0% Forward subsumption (3 calls)
% 0.21/0.56 ; 0.000 0% Backward subsumption (3 calls)
% 0.21/0.56 ; 0.010 17% Forward simplification (278 calls)
% 0.21/0.56 ; 0.006 10% Backward simplification (61 calls)
% 0.21/0.56 ; 0.004 7% Ordering (763 calls)
% 0.21/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.21/0.56 ; 0.000 0% Purity testing (1 call)
% 0.21/0.56 ; 0.025 42% Other
% 0.21/0.56 ; 0.059 Total
% 0.21/0.56 ; 0.064 Real time
% 0.21/0.56 ;
% 0.21/0.56 ; Term-hash-array has 200 terms in all.
% 0.21/0.56 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.21/0.56 ; Feature-vector-row-index has 1 node (36 at peak, 85 added, 84 deleted).
% 0.21/0.56 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.21/0.56 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.21/0.56 ; Path-index has 67 entries (82 at peak, 265 added, 198 deleted).
% 0.21/0.56 ; Path-index has 235 nodes (266 at peak, 514 added, 279 deleted).
% 0.21/0.56 ; Trie-index has 67 entries (82 at peak, 265 added, 198 deleted).
% 0.21/0.56 ; Trie-index has 201 nodes (276 at peak, 866 added, 665 deleted).
% 0.21/0.56 ; Retrieved 1,077 generalization terms in 1,334 calls.
% 0.21/0.56 ; Retrieved 228 instance terms in 65 calls.
% 0.21/0.56 ; Retrieved 687 unifiable terms in 193 calls.
% 0.21/0.56 ;
% 0.21/0.56 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.21/0.56 ; 2 with value 0
% 0.21/0.56 ; The agenda of rows to process has 24 entries:
% 0.21/0.56 ; 14 with value 21 6 with value 23 2 with value 24
% 0.21/0.56 ; 2 with value 22
% 0.21/0.56 ; The agenda of rows to give has 9 entries:
% 0.21/0.56 ; 1 with value (4 17) 1 with value (4 19) 1 with value (4 21)
% 0.21/0.56 ; 1 with value (4 18) 4 with value (4 20) 1 with value (4 22)
% 0.21/0.56 Evaluation took:
% 0.21/0.56 0.064 seconds of real time
% 0.21/0.56 0.051424 seconds of user run time
% 0.21/0.56 0.01317 seconds of system run time
% 0.21/0.56 0 calls to %EVAL
% 0.21/0.56 0 page faults and
% 0.21/0.56 5,416,472 bytes consed.
% 0.21/0.56 :PROOF-FOUND
% 0.21/0.56 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T12:29:16
% 0.21/0.56 :PROOF-FOUND
% 0.21/0.56 *
%------------------------------------------------------------------------------