TSTP Solution File: GRP097-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP097-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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 : 17
% Number of leaves : 3
% Syntax : Number of clauses : 42 ( 37 unt; 0 nHn; 9 RR)
% Number of literals : 52 ( 51 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 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 : 77 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,inverse(divide(divide(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,inverse(divide(Y,divide(X,inverse(divide(divide(Y,Z),divide(U,Z))))))) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(13,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).
cnf(16,plain,
divide(inverse(divide(X,Y)),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).
cnf(18,plain,
divide(divide(X,Y),inverse(divide(Z,divide(Z,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).
cnf(27,plain,
X = inverse(divide(divide(Y,Y),X)),
inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]) ).
cnf(28,plain,
divide(inverse(X),inverse(Y)) = inverse(divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[13,16,theory(equality)]) ).
cnf(31,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[16,28,theory(equality)]) ).
cnf(33,plain,
( inverse(divide(a1,a1)) != inverse(divide(b1,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,28,theory(equality)]) ).
cnf(34,plain,
inverse(divide(X,X)) = inverse(divide(Y,Y)),
inference('PARAMODULATE',[status(thm)],[31,7,theory(equality)]) ).
cnf(35,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)],[33,34,theory(equality)]) ).
cnf(38,plain,
inverse(divide(X,Y)) = inverse(divide(divide(X,Z),divide(Y,Z))),
inference('PARAMODULATE',[status(thm)],[31,single_axiom,theory(equality)]) ).
cnf(44,plain,
divide(X,divide(Y,Y)) = X,
inference('PARAMODULATE',[status(thm)],[7,27,theory(equality)]) ).
cnf(47,plain,
divide(divide(X,X),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[13,44,theory(equality)]) ).
cnf(49,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('PARAMODULATE',[status(thm)],[13,28,theory(equality)]) ).
cnf(60,plain,
divide(divide(X,X),Y) = divide(divide(Z,Y),Z),
inference('PARAMODULATE',[status(thm)],[47,31,theory(equality)]) ).
cnf(71,plain,
divide(divide(X,inverse(Y)),X) = Y,
inference('PARAMODULATE',[status(thm)],[13,49,theory(equality)]) ).
cnf(72,plain,
divide(divide(X,X),Y) = divide(Z,divide(Y,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[47,49,theory(equality)]) ).
cnf(75,plain,
divide(inverse(X),Y) = inverse(divide(X,divide(Z,divide(Y,inverse(Z))))),
inference('PARAMODULATE',[status(thm)],[28,49,theory(equality)]) ).
cnf(81,plain,
X = divide(Y,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[47,18,theory(equality)]) ).
cnf(82,plain,
divide(divide(X,Y),inverse(Y)) = X,
inference('REWRITE',[status(thm)],[18,81,theory(equality)]) ).
cnf(83,plain,
inverse(inverse(X)) = X,
inference('PARAMODULATE',[status(thm)],[31,82,theory(equality)]) ).
cnf(84,plain,
inverse(divide(X,Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,82,theory(equality)]),28,theory(equality)]) ).
cnf(85,plain,
divide(inverse(X),Y) = divide(divide(Z,divide(Y,inverse(Z))),X),
inference('REWRITE',[status(thm)],[75,84,theory(equality)]) ).
cnf(91,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)],[35,84,theory(equality)]) ).
cnf(102,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('REWRITE',[status(thm)],[28,84,theory(equality)]) ).
cnf(103,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('REWRITE',[status(thm)],[38,84,theory(equality)]) ).
cnf(105,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[82,71,theory(equality)]) ).
cnf(106,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[91,105,theory(equality)]) ).
cnf(107,plain,
divide(divide(X,Y),X) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[71,83,theory(equality)]) ).
cnf(108,plain,
divide(divide(X,X),Y) = inverse(Y),
inference('REWRITE',[status(thm)],[60,107,theory(equality)]) ).
cnf(109,plain,
inverse(X) = divide(Y,divide(X,inverse(Y))),
inference('REWRITE',[status(thm)],[72,108,theory(equality)]) ).
cnf(110,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('REWRITE',[status(thm)],[85,109,theory(equality)]) ).
cnf(111,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[106,110,theory(equality)]) ).
cnf(114,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[102,84,theory(equality)]) ).
cnf(115,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[111,114,theory(equality)]) ).
cnf(126,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[103,107,theory(equality)]),114,theory(equality)]) ).
cnf(127,plain,
$false,
inference('REWRITE',[status(thm)],[115,110,126,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP097-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 08:37:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/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.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:37:03
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-13T08:37:03
% 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.57 ||#
% 0.38/0.57
% 0.38/0.57 ; Summary of computation:
% 0.38/0.57 ; 731 formulas have been input or derived (from 38 formulas).
% 0.38/0.57 ; 127 (17%) were retained. Of these,
% 0.38/0.57 ; 104 (82%) were simplified or subsumed later,
% 0.38/0.57 ; 23 (18%) are still being kept.
% 0.38/0.57 ;
% 0.38/0.57 ; Run time in seconds excluding printing time:
% 0.38/0.57 ; 0.002 2% Read assertion file (1 call)
% 0.38/0.57 ; 0.000 0% Assert (3 calls)
% 0.38/0.57 ; 0.018 19% Process new row (695 calls)
% 0.38/0.57 ; 0.003 3% Resolution (74 calls)
% 0.38/0.57 ; 0.019 20% Paramodulation (37 calls)
% 0.38/0.57 ; 0.000 0% Condensing (4 calls)
% 0.38/0.57 ; 0.000 0% Forward subsumption (4 calls)
% 0.38/0.57 ; 0.000 0% Backward subsumption (4 calls)
% 0.38/0.57 ; 0.013 14% Forward simplification (620 calls)
% 0.38/0.57 ; 0.013 14% Backward simplification (126 calls)
% 0.38/0.57 ; 0.003 3% Ordering (1,356 calls)
% 0.38/0.57 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.57 ; 0.000 0% Purity testing (1 call)
% 0.38/0.57 ; 0.024 25% Other
% 0.38/0.57 ; 0.095 Total
% 0.38/0.57 ; 0.101 Real time
% 0.38/0.57 ;
% 0.38/0.57 ; Term-hash-array has 472 terms in all.
% 0.38/0.57 ; Feature-vector-row-index has 0 entries (1 at peak, 4 added, 4 deleted).
% 0.38/0.57 ; Feature-vector-row-index has 1 node (36 at peak, 111 added, 110 deleted).
% 0.38/0.57 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.38/0.57 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.38/0.57 ; Path-index has 73 entries (241 at peak, 594 added, 521 deleted).
% 0.38/0.57 ; Path-index has 773 nodes (880 at peak, 1,424 added, 651 deleted).
% 0.38/0.57 ; Trie-index has 73 entries (241 at peak, 594 added, 521 deleted).
% 0.38/0.57 ; Trie-index has 182 nodes (741 at peak, 1,720 added, 1,538 deleted).
% 0.38/0.57 ; Retrieved 1,395 generalization terms in 2,690 calls.
% 0.38/0.57 ; Retrieved 581 instance terms in 143 calls.
% 0.38/0.57 ; Retrieved 2,151 unifiable terms in 312 calls.
% 0.38/0.57 ;
% 0.38/0.57 ; The agenda of rows to process has 1 entry:
% 0.38/0.57 ; 1 with value 24
% 0.38/0.57 ; The agenda of rows to give has 13 entries:
% 0.38/0.57 ; 2 with value (4 19) 2 with value (4 21) 2 with value (4 25)
% 0.38/0.57 ; 1 with value (4 20) 6 with value (4 23)
% 0.38/0.57 Evaluation took:
% 0.38/0.57 0.102 seconds of real time
% 0.38/0.57 0.085642 seconds of user run time
% 0.38/0.57 0.016123 seconds of system run time
% 0.38/0.57 0 calls to %EVAL
% 0.38/0.57 0 page faults and
% 0.38/0.57 8,410,384 bytes consed.
% 0.38/0.57 :PROOF-FOUND
% 0.38/0.57 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:37:03
% 0.38/0.57 :PROOF-FOUND
% 0.38/0.57 *
%------------------------------------------------------------------------------