TSTP Solution File: GRP468-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP468-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:00 EDT 2022
% Result : Unsatisfiable 0.39s 0.55s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 4 RR)
% Number of literals : 32 ( 31 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 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_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,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(10,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(17,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(21,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(24,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(28,plain,
divide(X,divide(divide(Y,Y),inverse(X))) = divide(Z,Z),
inference('PARAMODULATE',[status(thm)],[7,21,theory(equality)]) ).
cnf(33,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)],[21,21,theory(equality)]) ).
cnf(38,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)],[21,5,theory(equality)]) ).
cnf(43,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,28,theory(equality)]),21,theory(equality)]) ).
cnf(47,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)],[38,43,theory(equality)]) ).
cnf(48,plain,
divide(divide(divide(X,divide(Y,Z)),inverse(Y)),Z) = X,
inference('REWRITE',[status(thm)],[10,47,theory(equality)]) ).
cnf(50,plain,
divide(divide(X,X),divide(Y,Z)) = divide(Z,Y),
inference('REWRITE',[status(thm)],[33,43,theory(equality)]) ).
cnf(57,plain,
divide(divide(divide(X,divide(Y,Y)),inverse(Z)),Z) = X,
inference('REWRITE',[status(thm)],[24,50,theory(equality)]) ).
cnf(60,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)],[17,50,theory(equality)]) ).
cnf(64,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)],[47,50,theory(equality)]) ).
cnf(65,plain,
divide(inverse(X),divide(inverse(Y),divide(X,Y))) = divide(Z,Z),
inference('REWRITE',[status(thm)],[60,64,theory(equality)]) ).
cnf(68,plain,
divide(divide(X,X),Y) = divide(inverse(Y),divide(Z,Z)),
inference('PARAMODULATE',[status(thm)],[50,43,theory(equality)]) ).
cnf(75,plain,
divide(inverse(X),divide(Y,X)) = inverse(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[48,65,theory(equality)]),43,theory(equality)]) ).
cnf(76,plain,
divide(inverse(X),divide(Y,Y)) = inverse(X),
inference('PARAMODULATE',[status(thm)],[75,7,theory(equality)]) ).
cnf(77,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('REWRITE',[status(thm)],[68,76,theory(equality)]) ).
cnf(80,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[50,77,theory(equality)]) ).
cnf(82,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[4,80,theory(equality)]) ).
cnf(89,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[43,77,theory(equality)]) ).
cnf(97,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[76,89,theory(equality)]) ).
cnf(99,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[57,97,theory(equality)]) ).
cnf(102,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,divide(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[48,99,theory(equality)]),80,theory(equality)]) ).
cnf(103,plain,
$false,
inference('REWRITE',[status(thm)],[82,102,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP468-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 18:52:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.47 #<PACKAGE "SNARK-USER">
% 0.21/0.47 *
% 0.21/0.47 SNARK-TPTP-OPTIONS
% 0.21/0.47 *
% 0.21/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47 (USE-FACTORING :POS)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.47 *
% 0.21/0.47 "."
% 0.21/0.47 *
% 0.21/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:52:52
% 0.21/0.47 ; 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-13T18:52:52
% 0.39/0.55
% 0.39/0.55
% 0.39/0.55 #||
% 0.39/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.55 % SZS output start Refutation
% See solution above
% 0.39/0.55 ||#
% 0.39/0.55
% 0.39/0.55 ; Summary of computation:
% 0.39/0.55 ; 266 formulas have been input or derived (from 18 formulas).
% 0.39/0.55 ; 103 (39%) were retained. Of these,
% 0.39/0.55 ; 84 (82%) were simplified or subsumed later,
% 0.39/0.55 ; 19 (18%) are still being kept.
% 0.39/0.55 ;
% 0.39/0.55 ; Run time in seconds excluding printing time:
% 0.39/0.55 ; 0.001 1% Read assertion file (1 call)
% 0.39/0.55 ; 0.000 0% Assert (3 calls)
% 0.39/0.55 ; 0.014 19% Process new row (249 calls)
% 0.39/0.55 ; 0.001 1% Resolution (34 calls)
% 0.39/0.55 ; 0.008 11% Paramodulation (17 calls)
% 0.39/0.55 ; 0.010 14% Forward simplification (209 calls)
% 0.39/0.55 ; 0.013 18% Backward simplification (102 calls)
% 0.39/0.55 ; 0.002 3% Ordering (555 calls)
% 0.39/0.55 ; 0.000 0% Sortal reasoning (32 calls)
% 0.39/0.55 ; 0.000 0% Purity testing (1 call)
% 0.39/0.55 ; 0.023 32% Other
% 0.39/0.55 ; 0.072 Total
% 0.39/0.55 ; 0.077 Real time
% 0.39/0.55 ;
% 0.39/0.55 ; Term-hash-array has 426 terms in all.
% 0.39/0.55 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.39/0.55 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.39/0.55 ; Path-index has 63 entries (227 at peak, 484 added, 421 deleted).
% 0.39/0.55 ; Path-index has 768 nodes (915 at peak, 1,321 added, 553 deleted).
% 0.39/0.55 ; Trie-index has 63 entries (227 at peak, 484 added, 421 deleted).
% 0.39/0.55 ; Trie-index has 227 nodes (1,245 at peak, 2,388 added, 2,161 deleted).
% 0.39/0.55 ; Retrieved 525 generalization terms in 1,284 calls.
% 0.39/0.55 ; Retrieved 510 instance terms in 103 calls.
% 0.39/0.55 ; Retrieved 1,215 unifiable terms in 131 calls.
% 0.39/0.55 ;
% 0.39/0.55 ; The agenda of backward simplifiable rows to process has 10 entries:
% 0.39/0.55 ; 10 with value 0
% 0.39/0.55 ; The agenda of rows to process has 2 entries:
% 0.39/0.55 ; 1 with value 22 1 with value 23
% 0.39/0.55 ; The agenda of rows to give has 13 entries:
% 0.39/0.55 ; 1 with value (4 16) 2 with value (4 20) 1 with value (4 25)
% 0.39/0.55 ; 2 with value (4 17) 3 with value (4 21) 1 with value (4 26)
% 0.39/0.55 ; 2 with value (4 19) 1 with value (4 24)
% 0.39/0.55 Evaluation took:
% 0.39/0.55 0.077 seconds of real time
% 0.39/0.55 0.067161 seconds of user run time
% 0.39/0.55 0.010046 seconds of system run time
% 0.39/0.55 0 calls to %EVAL
% 0.39/0.55 0 page faults and
% 0.39/0.55 6,886,744 bytes consed.
% 0.39/0.55 :PROOF-FOUND
% 0.39/0.55 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:52:52
% 0.39/0.55 :PROOF-FOUND
% 0.39/0.55 *
%------------------------------------------------------------------------------