TSTP Solution File: GRP098-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP098-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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:08 EDT 2022
% Result : Unsatisfiable 0.38s 0.56s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 32 ( 26 unt; 0 nHn; 9 RR)
% Number of literals : 43 ( 42 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(divide(X,inverse(Y)),Z),divide(X,Z)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox/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))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox/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))))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,multiply,theory(equality)]) ).
cnf(5,plain,
divide(X,divide(divide(Y,inverse(X)),divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
divide(divide(divide(divide(divide(X,inverse(Y)),Z),inverse(U)),divide(X,Z)),Y) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(9,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(18,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,9,theory(equality)]) ).
cnf(19,plain,
divide(X,divide(inverse(Y),inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[9,9,theory(equality)]) ).
cnf(20,plain,
divide(divide(X,Y),divide(divide(inverse(Z),inverse(X)),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,9,theory(equality)]) ).
cnf(27,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[9,18,theory(equality)]) ).
cnf(28,plain,
( divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1))
| 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)],[4,27,theory(equality)]) ).
cnf(31,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,27,theory(equality)]),27,theory(equality)]) ).
cnf(32,plain,
divide(divide(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,27,theory(equality)]),31,theory(equality)]) ).
cnf(36,plain,
divide(X,X) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[31,18,theory(equality)]) ).
cnf(37,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)],[28,36,theory(equality)]) ).
cnf(38,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[31,27,theory(equality)]) ).
cnf(41,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[27,38,theory(equality)]) ).
cnf(53,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[9,41,theory(equality)]) ).
cnf(57,plain,
divide(X,Y) = divide(inverse(Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[31,19,theory(equality)]) ).
cnf(60,plain,
divide(divide(X,Y),divide(divide(X,Z),Y)) = Z,
inference('REWRITE',[status(thm)],[20,57,theory(equality)]) ).
cnf(64,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[53,31,theory(equality)]) ).
cnf(65,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[37,64,theory(equality)]) ).
cnf(67,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[32,53,theory(equality)]) ).
cnf(68,plain,
( divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3))
| divide(a4,inverse(b4)) != divide(b4,inverse(a4)) ),
inference('REWRITE',[status(thm)],[65,67,theory(equality)]) ).
cnf(71,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[57,41,theory(equality)]) ).
cnf(72,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[68,71,theory(equality)]) ).
cnf(73,plain,
divide(X,divide(Y,Z)) = divide(divide(Z,Y),inverse(X)),
inference('PARAMODULATE',[status(thm)],[57,64,theory(equality)]) ).
cnf(88,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[72,73,theory(equality)]) ).
cnf(90,plain,
divide(divide(X,Y),Z) = divide(divide(X,Z),Y),
inference('PARAMODULATE',[status(thm)],[31,60,theory(equality)]) ).
cnf(115,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[64,90,theory(equality)]),64,theory(equality)]) ).
cnf(120,plain,
$false,
inference('REWRITE',[status(thm)],[88,67,115,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP098-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n028.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 : Tue Jun 14 04:45:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 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/sandbox/benchmark/theBenchmark.p 2022-06-14T04:45:53
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-14T04:45:53
% 0.38/0.56
% 0.38/0.56
% 0.38/0.56 #||
% 0.38/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.56 % SZS output start Refutation
% See solution above
% 0.38/0.56 ||#
% 0.38/0.56
% 0.38/0.56 ; Summary of computation:
% 0.38/0.56 ; 490 formulas have been input or derived (from 30 formulas).
% 0.38/0.56 ; 120 (24%) were retained. Of these,
% 0.38/0.56 ; 86 (72%) were simplified or subsumed later,
% 0.38/0.56 ; 34 (28%) are still being kept.
% 0.38/0.56 ;
% 0.38/0.56 ; Run time in seconds excluding printing time:
% 0.38/0.56 ; 0.001 1% Read assertion file (1 call)
% 0.38/0.56 ; 0.001 1% Assert (3 calls)
% 0.38/0.56 ; 0.013 13% Process new row (444 calls)
% 0.38/0.56 ; 0.005 5% Resolution (58 calls)
% 0.38/0.56 ; 0.011 11% Paramodulation (29 calls)
% 0.38/0.56 ; 0.000 0% Condensing (5 calls)
% 0.38/0.56 ; 0.000 0% Forward subsumption (5 calls)
% 0.38/0.56 ; 0.000 0% Backward subsumption (5 calls)
% 0.38/0.56 ; 0.016 16% Forward simplification (397 calls)
% 0.38/0.56 ; 0.019 19% Backward simplification (119 calls)
% 0.38/0.56 ; 0.007 7% Ordering (1,288 calls)
% 0.38/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.56 ; 0.000 0% Purity testing (1 call)
% 0.38/0.56 ; 0.026 26% Other
% 0.38/0.56 ; 0.099 Total
% 0.38/0.56 ; 0.104 Real time
% 0.38/0.56 ;
% 0.38/0.56 ; Term-hash-array has 510 terms in all.
% 0.38/0.56 ; Feature-vector-row-index has 0 entries (1 at peak, 5 added, 5 deleted).
% 0.38/0.56 ; Feature-vector-row-index has 1 node (36 at peak, 134 added, 133 deleted).
% 0.38/0.56 ; Retrieved 0 possibly forward subsuming rows in 5 calls.
% 0.38/0.56 ; Retrieved 0 possibly backward subsumed rows in 5 calls.
% 0.38/0.56 ; Path-index has 122 entries (191 at peak, 635 added, 513 deleted).
% 0.38/0.56 ; Path-index has 623 nodes (731 at peak, 1,256 added, 633 deleted).
% 0.38/0.56 ; Trie-index has 122 entries (191 at peak, 635 added, 513 deleted).
% 0.38/0.56 ; Trie-index has 436 nodes (886 at peak, 2,419 added, 1,983 deleted).
% 0.38/0.56 ; Retrieved 2,100 generalization terms in 2,332 calls.
% 0.38/0.56 ; Retrieved 853 instance terms in 119 calls.
% 0.38/0.56 ; Retrieved 2,324 unifiable terms in 270 calls.
% 0.38/0.56 ;
% 0.38/0.56 ; The agenda of rows to process has 35 entries:
% 0.38/0.56 ; 9 with value 23 8 with value 25 4 with value 28
% 0.38/0.56 ; 10 with value 24 4 with value 26
% 0.38/0.56 ; The agenda of rows to give has 20 entries:
% 0.38/0.56 ; 2 with value (4 20) 1 with value (4 24) 1 with value (4 28)
% 0.38/0.56 ; 2 with value (4 21) 1 with value (4 25) 1 with value (4 31)
% 0.38/0.56 ; 4 with value (4 22) 2 with value (4 26) 1 with value (4 33)
% 0.38/0.56 ; 3 with value (4 23) 2 with value (4 27)
% 0.38/0.56 Evaluation took:
% 0.38/0.56 0.104 seconds of real time
% 0.38/0.56 0.087818 seconds of user run time
% 0.38/0.56 0.015415 seconds of system run time
% 0.38/0.56 0 calls to %EVAL
% 0.38/0.56 0 page faults and
% 0.38/0.56 7,669,288 bytes consed.
% 0.38/0.56 :PROOF-FOUND
% 0.38/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:45:53
% 0.38/0.56 :PROOF-FOUND
% 0.38/0.56 *
%------------------------------------------------------------------------------