TSTP Solution File: GRP524-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.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:39:16 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 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_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(5,plain,
multiply(X,Y) = divide(X,inverse(Y)),
inference('REWRITE',[status(thm)],[multiply,inverse,theory(equality)]) ).
cnf(6,plain,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference('REWRITE',[status(thm)],[prove_these_axioms_4,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(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(59,plain,
divide(X,inverse(Y)) = divide(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[51,42,theory(equality)]) ).
cnf(60,plain,
$false,
inference('REWRITE',[status(thm)],[6,59,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/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 : Mon Jun 13 10:50:44 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.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (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-13T10:50:44
% 0.20/0.48 ; 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-13T10:50:44
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 #||
% 0.20/0.52 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 242 formulas have been input or derived (from 19 formulas).
% 0.20/0.53 ; 60 (25%) were retained. Of these,
% 0.20/0.53 ; 40 (67%) were simplified or subsumed later,
% 0.20/0.53 ; 20 (33%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.001 2% Read assertion file (1 call)
% 0.20/0.53 ; 0.001 2% Assert (4 calls)
% 0.20/0.53 ; 0.004 9% Process new row (227 calls)
% 0.20/0.53 ; 0.002 4% Resolution (36 calls)
% 0.20/0.53 ; 0.006 13% Paramodulation (18 calls)
% 0.20/0.53 ; 0.007 15% Forward simplification (215 calls)
% 0.20/0.53 ; 0.003 7% Backward simplification (60 calls)
% 0.20/0.53 ; 0.000 0% Ordering (415 calls)
% 0.20/0.53 ; 0.001 2% Sortal reasoning (32 calls)
% 0.20/0.53 ; 0.000 0% Purity testing (1 call)
% 0.20/0.53 ; 0.021 46% Other
% 0.20/0.53 ; 0.046 Total
% 0.20/0.53 ; 0.050 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 174 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.20/0.53 ; Path-index has 50 entries (125 at peak, 185 added, 135 deleted).
% 0.20/0.53 ; Path-index has 299 nodes (425 at peak, 453 added, 154 deleted).
% 0.20/0.53 ; Trie-index has 50 entries (125 at peak, 185 added, 135 deleted).
% 0.20/0.53 ; Trie-index has 140 nodes (439 at peak, 553 added, 413 deleted).
% 0.20/0.53 ; Retrieved 306 generalization terms in 875 calls.
% 0.20/0.53 ; Retrieved 190 instance terms in 61 calls.
% 0.20/0.53 ; Retrieved 481 unifiable terms in 105 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of rows to process has 7 entries:
% 0.20/0.53 ; 1 with value 16 1 with value 18 3 with value 19
% 0.20/0.53 ; 2 with value 17
% 0.20/0.53 ; The agenda of rows to give has 8 entries:
% 0.20/0.53 ; 4 with value (4 16) 1 with value (4 18) 1 with value (4 20)
% 0.20/0.53 ; 1 with value (4 17) 1 with value (4 19)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.05 seconds of real time
% 0.20/0.53 0.044067 seconds of user run time
% 0.20/0.53 0.00625 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 3,856,992 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T10:50:44
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------