TSTP Solution File: GRP070-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP070-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:00 EDT 2022
% Result : Unsatisfiable 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 35 ( 31 unt; 0 nHn; 7 RR)
% Number of literals : 41 ( 40 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(X,X),divide(Y,divide(divide(Z,divide(U,Y)),inverse(U)))) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
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)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(4,plain,
( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,multiply,theory(equality)]) ).
cnf(5,plain,
divide(divide(X,X),divide(divide(divide(Y,divide(Z,U)),inverse(Z)),divide(Y,inverse(U)))) = divide(V,V),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(X,X) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(8,plain,
( divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('REWRITE',[status(thm)],[4,7,theory(equality)]) ).
cnf(11,plain,
divide(divide(divide(X,X),divide(divide(divide(Y,divide(Z,U)),inverse(Z)),divide(Y,inverse(U)))),divide(V,divide(divide(W,divide(X1,V)),inverse(X1)))) = W,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(18,plain,
divide(divide(X,X),divide(divide(divide(inverse(Y),divide(Z,Y)),inverse(Z)),divide(divide(U,U),divide(divide(divide(V,divide(W,X1)),inverse(W)),divide(V,inverse(X1)))))) = divide(Y1,Y1),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(23,plain,
divide(divide(X,X),divide(Y,divide(divide(Z,Z),inverse(U)))) = divide(U,Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,7,theory(equality)]) ).
cnf(26,plain,
divide(divide(X,X),divide(Y,divide(divide(Z,divide(U,U)),inverse(Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,7,theory(equality)]) ).
cnf(30,plain,
( divide(divide(X,X),inverse(a2)) != a2
| divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))) ),
inference('PARAMODULATE',[status(thm)],[8,7,theory(equality)]) ).
cnf(31,plain,
divide(X,divide(divide(Y,Y),inverse(X))) = divide(Z,Z),
inference('PARAMODULATE',[status(thm)],[7,23,theory(equality)]) ).
cnf(36,plain,
divide(divide(X,X),divide(Y,divide(divide(Z,divide(divide(U,U),inverse(Z))),inverse(V)))) = divide(V,Y),
inference('PARAMODULATE',[status(thm)],[23,23,theory(equality)]) ).
cnf(41,plain,
divide(divide(divide(X,X),divide(divide(divide(Y,divide(Z,U)),inverse(Z)),divide(Y,inverse(U)))),divide(V,divide(divide(W,W),inverse(X1)))) = divide(X1,V),
inference('PARAMODULATE',[status(thm)],[23,5,theory(equality)]) ).
cnf(46,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,31,theory(equality)]),23,theory(equality)]) ).
cnf(50,plain,
divide(divide(divide(X,X),divide(divide(divide(Y,divide(Z,U)),inverse(Z)),divide(Y,inverse(U)))),divide(V,W)) = divide(W,V),
inference('REWRITE',[status(thm)],[41,46,theory(equality)]) ).
cnf(51,plain,
divide(divide(divide(X,divide(Y,Z)),inverse(Y)),Z) = X,
inference('REWRITE',[status(thm)],[11,50,theory(equality)]) ).
cnf(53,plain,
divide(divide(X,X),divide(Y,Z)) = divide(Z,Y),
inference('REWRITE',[status(thm)],[36,46,theory(equality)]) ).
cnf(60,plain,
divide(divide(divide(X,divide(Y,Y)),inverse(Z)),Z) = X,
inference('REWRITE',[status(thm)],[26,53,theory(equality)]) ).
cnf(63,plain,
divide(divide(divide(X,inverse(Y)),divide(divide(X,divide(Z,Y)),inverse(Z))),divide(divide(inverse(U),divide(V,U)),inverse(V))) = divide(W,W),
inference('REWRITE',[status(thm)],[18,53,theory(equality)]) ).
cnf(68,plain,
divide(divide(divide(X,inverse(Y)),divide(divide(X,divide(Z,Y)),inverse(Z))),divide(U,V)) = divide(V,U),
inference('REWRITE',[status(thm)],[50,53,theory(equality)]) ).
cnf(69,plain,
divide(inverse(X),divide(inverse(Y),divide(X,Y))) = divide(Z,Z),
inference('REWRITE',[status(thm)],[63,68,theory(equality)]) ).
cnf(72,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[30,46,theory(equality)]) ).
cnf(73,plain,
divide(divide(X,X),Y) = divide(inverse(Y),divide(Z,Z)),
inference('PARAMODULATE',[status(thm)],[53,46,theory(equality)]) ).
cnf(80,plain,
divide(inverse(X),divide(Y,X)) = inverse(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[51,69,theory(equality)]),46,theory(equality)]) ).
cnf(81,plain,
divide(inverse(X),divide(Y,Y)) = inverse(X),
inference('PARAMODULATE',[status(thm)],[80,7,theory(equality)]) ).
cnf(82,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('REWRITE',[status(thm)],[73,81,theory(equality)]) ).
cnf(85,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[53,82,theory(equality)]) ).
cnf(87,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[72,85,theory(equality)]) ).
cnf(94,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[46,82,theory(equality)]) ).
cnf(102,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[81,94,theory(equality)]) ).
cnf(104,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[60,102,theory(equality)]) ).
cnf(107,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[51,104,theory(equality)]),85,theory(equality)]) ).
cnf(108,plain,
$false,
inference('REWRITE',[status(thm)],[87,107,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP070-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 0.12/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 19:42:20 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T19:42:20
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-13T19:42:20
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 #||
% 0.19/0.54 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.54 % SZS output start Refutation
% See solution above
% 0.19/0.54 ||#
% 0.19/0.54
% 0.19/0.54 ; Summary of computation:
% 0.19/0.54 ; 275 formulas have been input or derived (from 18 formulas).
% 0.19/0.54 ; 108 (39%) were retained. Of these,
% 0.19/0.54 ; 89 (82%) were simplified or subsumed later,
% 0.19/0.54 ; 19 (18%) are still being kept.
% 0.19/0.54 ;
% 0.19/0.54 ; Run time in seconds excluding printing time:
% 0.19/0.54 ; 0.002 3% Read assertion file (1 call)
% 0.19/0.54 ; 0.000 0% Assert (3 calls)
% 0.19/0.54 ; 0.016 22% Process new row (258 calls)
% 0.19/0.54 ; 0.000 0% Resolution (34 calls)
% 0.19/0.54 ; 0.009 12% Paramodulation (17 calls)
% 0.19/0.54 ; 0.000 0% Condensing (5 calls)
% 0.19/0.54 ; 0.000 0% Forward subsumption (5 calls)
% 0.19/0.54 ; 0.000 0% Backward subsumption (5 calls)
% 0.19/0.54 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.19/0.54 ; 0.009 12% Forward simplification (214 calls)
% 0.19/0.54 ; 0.011 15% Backward simplification (107 calls)
% 0.19/0.54 ; 0.002 3% Ordering (553 calls)
% 0.19/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.54 ; 0.000 0% Purity testing (1 call)
% 0.19/0.54 ; 0.025 34% Other
% 0.19/0.54 ; 0.074 Total
% 0.19/0.54 ; 0.080 Real time
% 0.19/0.54 ;
% 0.19/0.54 ; Term-hash-array has 442 terms in all.
% 0.19/0.54 ; Feature-vector-row-index has 0 entries (2 at peak, 5 added, 5 deleted).
% 0.19/0.54 ; Feature-vector-row-index has 1 node (44 at peak, 99 added, 98 deleted).
% 0.19/0.54 ; Retrieved 0 possibly forward subsuming rows in 5 calls.
% 0.19/0.54 ; Retrieved 2 possibly backward subsumed rows in 5 calls.
% 0.19/0.54 ; Path-index has 63 entries (233 at peak, 535 added, 472 deleted).
% 0.19/0.54 ; Path-index has 769 nodes (922 at peak, 1,407 added, 638 deleted).
% 0.19/0.54 ; Trie-index has 63 entries (233 at peak, 535 added, 472 deleted).
% 0.19/0.54 ; Trie-index has 227 nodes (1,254 at peak, 2,531 added, 2,304 deleted).
% 0.19/0.54 ; Retrieved 539 generalization terms in 1,338 calls.
% 0.19/0.54 ; Retrieved 514 instance terms in 103 calls.
% 0.19/0.54 ; Retrieved 1,202 unifiable terms in 150 calls.
% 0.19/0.54 ;
% 0.19/0.54 ; The agenda of backward simplifiable rows to process has 10 entries:
% 0.19/0.54 ; 10 with value 0
% 0.19/0.54 ; The agenda of rows to process has 2 entries:
% 0.19/0.54 ; 1 with value 22 1 with value 23
% 0.19/0.54 ; The agenda of rows to give has 13 entries:
% 0.19/0.54 ; 1 with value (4 16) 2 with value (4 20) 1 with value (4 25)
% 0.19/0.54 ; 2 with value (4 17) 3 with value (4 21) 1 with value (4 26)
% 0.19/0.54 ; 2 with value (4 19) 1 with value (4 24)
% 0.19/0.54 Evaluation took:
% 0.19/0.54 0.08 seconds of real time
% 0.19/0.54 0.069822 seconds of user run time
% 0.19/0.54 0.010749 seconds of system run time
% 0.19/0.54 0 calls to %EVAL
% 0.19/0.54 0 page faults and
% 0.19/0.54 7,698,080 bytes consed.
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T19:42:20
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 *
%------------------------------------------------------------------------------