TSTP Solution File: GRP450-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP450-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:38:56 EDT 2022
% Result : Unsatisfiable 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 4
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 4 RR)
% Number of literals : 40 ( 39 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 : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(divide(divide(divide(Y,Y),Y),Z),divide(divide(divide(Y,Y),X),Z))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,divide(divide(Z,Z),Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(inverse,axiom,
inverse(X) = divide(divide(Y,Y),X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,5,theory(equality)]) ).
cnf(7,plain,
divide(X,divide(divide(inverse(Y),Z),divide(inverse(X),Z))) = Y,
inference('REWRITE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(8,plain,
inverse(X) = divide(inverse(divide(Y,Y)),X),
inference('PARAMODULATE',[status(thm)],[inverse,inverse,theory(equality)]) ).
cnf(9,plain,
divide(X,inverse(divide(inverse(X),inverse(Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[7,inverse,theory(equality)]) ).
cnf(10,plain,
inverse(divide(divide(inverse(X),Y),inverse(Y))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[inverse,7,theory(equality)]),8,theory(equality)]) ).
cnf(11,plain,
divide(X,divide(Y,divide(inverse(X),divide(divide(inverse(Y),Z),divide(inverse(inverse(U)),Z))))) = U,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(16,plain,
divide(X,inverse(Y)) = divide(inverse(inverse(X)),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[9,9,theory(equality)]) ).
cnf(17,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,8,theory(equality)]),inverse,theory(equality)]) ).
cnf(20,plain,
divide(inverse(X),inverse(divide(X,inverse(Y)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,17,theory(equality)]),16,theory(equality)]) ).
cnf(21,plain,
divide(X,inverse(divide(inverse(X),Y))) = inverse(inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[9,17,theory(equality)]) ).
cnf(23,plain,
divide(X,divide(divide(Y,Z),divide(inverse(X),Z))) = inverse(inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[7,17,theory(equality)]) ).
cnf(24,plain,
inverse(divide(inverse(X),inverse(X))) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[10,8,theory(equality)]) ).
cnf(25,plain,
inverse(inverse(inverse(X))) = divide(divide(inverse(X),Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[17,10,theory(equality)]) ).
cnf(27,plain,
inverse(divide(X,X)) = divide(Y,Y),
inference('PARAMODULATE',[status(thm)],[24,17,theory(equality)]) ).
cnf(33,plain,
divide(X,Y) = divide(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[16,17,theory(equality)]) ).
cnf(36,plain,
divide(X,divide(Y,divide(inverse(X),divide(divide(inverse(Y),Z),divide(U,Z))))) = U,
inference('REWRITE',[status(thm)],[11,33,theory(equality)]) ).
cnf(47,plain,
divide(X,divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,27,theory(equality)]),33,theory(equality)]) ).
cnf(49,plain,
divide(inverse(X),inverse(divide(X,Y))) = inverse(inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[20,17,theory(equality)]) ).
cnf(50,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,47,theory(equality)]),47,theory(equality)]) ).
cnf(51,plain,
divide(X,inverse(divide(inverse(X),Y))) = inverse(Y),
inference('REWRITE',[status(thm)],[21,50,theory(equality)]) ).
cnf(52,plain,
divide(X,divide(divide(Y,Z),divide(inverse(X),Z))) = inverse(Y),
inference('REWRITE',[status(thm)],[23,50,theory(equality)]) ).
cnf(53,plain,
divide(inverse(X),inverse(divide(X,Y))) = inverse(Y),
inference('REWRITE',[status(thm)],[49,50,theory(equality)]) ).
cnf(54,plain,
inverse(X) = divide(divide(inverse(X),Y),inverse(Y)),
inference('REWRITE',[status(thm)],[25,50,theory(equality)]) ).
cnf(55,plain,
X = divide(divide(X,Y),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[54,50,theory(equality)]) ).
cnf(56,plain,
X = divide(divide(X,inverse(Y)),Y),
inference('PARAMODULATE',[status(thm)],[55,50,theory(equality)]) ).
cnf(59,plain,
inverse(X) = divide(inverse(Y),divide(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[55,53,theory(equality)]),50,theory(equality)]) ).
cnf(61,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[51,59,theory(equality)]),50,theory(equality)]) ).
cnf(64,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[6,61,theory(equality)]) ).
cnf(70,plain,
divide(X,divide(Y,divide(inverse(X),Z))) = divide(inverse(Z),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,56,theory(equality)]),61,theory(equality)]) ).
cnf(71,plain,
divide(divide(divide(X,Y),divide(inverse(Z),Y)),Z) = X,
inference('REWRITE',[status(thm)],[36,61,70,theory(equality)]) ).
cnf(73,plain,
divide(divide(X,divide(inverse(Y),Z)),Y) = divide(divide(X,U),divide(inverse(Z),U)),
inference('PARAMODULATE',[status(thm)],[71,71,theory(equality)]) ).
cnf(74,plain,
divide(divide(X,Y),divide(inverse(Z),Y)) = divide(X,inverse(Z)),
inference('PARAMODULATE',[status(thm)],[55,71,theory(equality)]) ).
cnf(75,plain,
divide(divide(X,divide(inverse(Y),Z)),Y) = divide(X,inverse(Z)),
inference('REWRITE',[status(thm)],[73,74,theory(equality)]) ).
cnf(77,plain,
divide(X,divide(inverse(Y),Z)) = divide(divide(X,inverse(Z)),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[55,75,theory(equality)]) ).
cnf(78,plain,
$false,
inference('REWRITE',[status(thm)],[64,77,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP450-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n013.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 : Tue Jun 14 02:25:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 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-14T02:25:59
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-14T02:25:59
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 #||
% 0.19/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/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 ; 562 formulas have been input or derived (from 34 formulas).
% 0.19/0.54 ; 78 (14%) were retained. Of these,
% 0.19/0.54 ; 58 (74%) were simplified or subsumed later,
% 0.19/0.54 ; 20 (26%) 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 (4 calls)
% 0.19/0.54 ; 0.015 23% Process new row (543 calls)
% 0.19/0.54 ; 0.001 2% Resolution (66 calls)
% 0.19/0.54 ; 0.005 8% Paramodulation (33 calls)
% 0.19/0.54 ; 0.009 14% Forward simplification (441 calls)
% 0.19/0.54 ; 0.004 6% Backward simplification (78 calls)
% 0.19/0.54 ; 0.003 5% Ordering (915 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.027 41% Other
% 0.19/0.54 ; 0.066 Total
% 0.19/0.54 ; 0.073 Real time
% 0.19/0.54 ;
% 0.19/0.54 ; Term-hash-array has 232 terms in all.
% 0.19/0.54 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.54 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.54 ; Path-index has 62 entries (116 at peak, 267 added, 205 deleted).
% 0.19/0.54 ; Path-index has 350 nodes (411 at peak, 569 added, 219 deleted).
% 0.19/0.54 ; Trie-index has 62 entries (116 at peak, 267 added, 205 deleted).
% 0.19/0.54 ; Trie-index has 238 nodes (421 at peak, 986 added, 748 deleted).
% 0.19/0.54 ; Retrieved 694 generalization terms in 2,147 calls.
% 0.19/0.54 ; Retrieved 188 instance terms in 80 calls.
% 0.19/0.54 ; Retrieved 1,177 unifiable terms in 231 calls.
% 0.19/0.54 ;
% 0.19/0.54 ; The agenda of rows to process has 7 entries:
% 0.19/0.54 ; 1 with value 25 3 with value 28 1 with value 30
% 0.19/0.54 ; 1 with value 27 1 with value 29
% 0.19/0.54 ; The agenda of rows to give has 9 entries:
% 0.19/0.54 ; 1 with value (4 21) 2 with value (4 24) 1 with value (4 26)
% 0.19/0.54 ; 2 with value (4 23) 3 with value (4 25)
% 0.19/0.54 Evaluation took:
% 0.19/0.54 0.073 seconds of real time
% 0.19/0.54 0.06153 seconds of user run time
% 0.19/0.54 0.011168 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 6,506,560 bytes consed.
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T02:25:59
% 0.19/0.54 :PROOF-FOUND
% 0.19/0.54 *
%------------------------------------------------------------------------------