TSTP Solution File: GRP523-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP523-1 : TPTP v8.1.0. Released v2.6.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:39:16 EDT 2022
% Result : Unsatisfiable 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 7 RR)
% Number of literals : 35 ( 34 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X,divide(Y,divide(Z,divide(X,Y)))) = Z,
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,
inverse(X) = divide(inverse(divide(Y,Y)),X),
inference('PARAMODULATE',[status(thm)],[inverse,inverse,theory(equality)]) ).
cnf(8,plain,
divide(X,divide(divide(Y,divide(Z,X)),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(9,plain,
inverse(divide(X,divide(Y,inverse(X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]),inverse,theory(equality)]) ).
cnf(10,plain,
divide(X,divide(Y,inverse(divide(X,Y)))) = divide(Z,Z),
inference('PARAMODULATE',[status(thm)],[single_axiom,inverse,theory(equality)]) ).
cnf(19,plain,
inverse(inverse(divide(X,inverse(divide(Y,Y))))) = X,
inference('PARAMODULATE',[status(thm)],[9,inverse,theory(equality)]) ).
cnf(22,plain,
inverse(X) = divide(inverse(Y),divide(X,Y)),
inference('PARAMODULATE',[status(thm)],[9,8,theory(equality)]) ).
cnf(23,plain,
divide(X,inverse(divide(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[8,inverse,theory(equality)]) ).
cnf(24,plain,
divide(X,X) = divide(Y,Y),
inference('REWRITE',[status(thm)],[10,23,theory(equality)]) ).
cnf(26,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(30,plain,
inverse(divide(divide(X,divide(Y,divide(Z,Z))),X)) = Y,
inference('PARAMODULATE',[status(thm)],[inverse,8,theory(equality)]) ).
cnf(33,plain,
inverse(divide(divide(X,divide(Y,inverse(divide(Z,Z)))),X)) = Y,
inference('PARAMODULATE',[status(thm)],[7,8,theory(equality)]) ).
cnf(39,plain,
divide(X,divide(Y,divide(Z,Z))) = divide(X,Y),
inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]) ).
cnf(40,plain,
inverse(divide(divide(X,Y),X)) = Y,
inference('REWRITE',[status(thm)],[30,39,theory(equality)]) ).
cnf(41,plain,
divide(X,inverse(divide(Y,Y))) = X,
inference('REWRITE',[status(thm)],[33,40,theory(equality)]) ).
cnf(42,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[19,41,theory(equality)]) ).
cnf(44,plain,
divide(X,divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,24,theory(equality)]),39,theory(equality)]) ).
cnf(51,plain,
divide(inverse(X),inverse(Y)) = divide(Y,X),
inference('PARAMODULATE',[status(thm)],[44,22,theory(equality)]) ).
cnf(52,plain,
inverse(X) = divide(inverse(divide(X,Y)),Y),
inference('PARAMODULATE',[status(thm)],[22,44,theory(equality)]) ).
cnf(53,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[44,23,theory(equality)]) ).
cnf(54,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[6,53,theory(equality)]) ).
cnf(55,plain,
inverse(X) = divide(divide(Y,X),Y),
inference('REWRITE',[status(thm)],[52,53,theory(equality)]) ).
cnf(60,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[51,42,theory(equality)]) ).
cnf(61,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[54,60,theory(equality)]) ).
cnf(62,plain,
divide(inverse(X),Y) = divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[51,42,theory(equality)]) ).
cnf(63,plain,
divide(divide(b3,inverse(a3)),inverse(c3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[61,62,theory(equality)]) ).
cnf(64,plain,
divide(divide(X,Y),inverse(Z)) = divide(Z,divide(Y,X)),
inference('PARAMODULATE',[status(thm)],[51,53,theory(equality)]) ).
cnf(65,plain,
divide(c3,divide(inverse(a3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference('REWRITE',[status(thm)],[63,64,theory(equality)]) ).
cnf(70,plain,
divide(X,divide(Y,Z)) = divide(Z,divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[26,55,theory(equality)]),64,theory(equality)]) ).
cnf(71,plain,
$false,
inference('REWRITE',[status(thm)],[65,62,70,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP523-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n028.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 10:02:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T10:02:39
% 0.20/0.48 ; 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-14T10:02:39
% 0.20/0.53
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.54 ||#
% 0.20/0.54
% 0.20/0.54 ; Summary of computation:
% 0.20/0.54 ; 281 formulas have been input or derived (from 22 formulas).
% 0.20/0.54 ; 71 (25%) were retained. Of these,
% 0.20/0.54 ; 51 (72%) were simplified or subsumed later,
% 0.20/0.54 ; 20 (28%) are still being kept.
% 0.20/0.54 ;
% 0.20/0.54 ; Run time in seconds excluding printing time:
% 0.20/0.54 ; 0.001 2% Read assertion file (1 call)
% 0.20/0.54 ; 0.000 0% Assert (4 calls)
% 0.20/0.54 ; 0.010 19% Process new row (268 calls)
% 0.20/0.54 ; 0.001 2% Resolution (42 calls)
% 0.20/0.54 ; 0.004 8% Paramodulation (21 calls)
% 0.20/0.54 ; 0.008 15% Forward simplification (256 calls)
% 0.20/0.54 ; 0.007 13% Backward simplification (71 calls)
% 0.20/0.54 ; 0.000 0% Ordering (533 calls)
% 0.20/0.54 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.54 ; 0.000 0% Purity testing (1 call)
% 0.20/0.54 ; 0.021 40% Other
% 0.20/0.54 ; 0.052 Total
% 0.20/0.54 ; 0.058 Real time
% 0.20/0.54 ;
% 0.20/0.54 ; Term-hash-array has 209 terms in all.
% 0.20/0.54 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.54 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.54 ; Path-index has 56 entries (129 at peak, 254 added, 198 deleted).
% 0.20/0.54 ; Path-index has 312 nodes (449 at peak, 570 added, 258 deleted).
% 0.20/0.54 ; Trie-index has 56 entries (129 at peak, 254 added, 198 deleted).
% 0.20/0.54 ; Trie-index has 151 nodes (457 at peak, 750 added, 599 deleted).
% 0.20/0.54 ; Retrieved 468 generalization terms in 1,118 calls.
% 0.20/0.54 ; Retrieved 272 instance terms in 75 calls.
% 0.20/0.54 ; Retrieved 642 unifiable terms in 139 calls.
% 0.20/0.54 ;
% 0.20/0.54 ; The agenda of rows to process has 5 entries:
% 0.20/0.54 ; 1 with value 19 2 with value 21 2 with value 22
% 0.20/0.54 ; The agenda of rows to give has 9 entries:
% 0.20/0.54 ; 2 with value (4 16) 2 with value (4 18) 1 with value (4 20)
% 0.20/0.54 ; 1 with value (4 17) 3 with value (4 19)
% 0.20/0.54 Evaluation took:
% 0.20/0.54 0.058 seconds of real time
% 0.20/0.54 0.048865 seconds of user run time
% 0.20/0.54 0.008888 seconds of system run time
% 0.20/0.54 0 calls to %EVAL
% 0.20/0.54 0 page faults and
% 0.20/0.54 5,163,240 bytes consed.
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T10:02:39
% 0.20/0.54 :PROOF-FOUND
% 0.20/0.54 *
%------------------------------------------------------------------------------