TSTP Solution File: GRP591-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n003.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:34 EDT 2022
% Result : Unsatisfiable 0.49s 0.66s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 5 RR)
% Number of literals : 48 ( 47 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 105 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(Z))))),Y) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,plain,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,multiply,theory(equality)]) ).
cnf(5,plain,
double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X,inverse(Y)),inverse(double_divide(X,inverse(Z))))),U),inverse(Z))),U) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
double_divide(inverse(double_divide(X,inverse(X))),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(13,plain,
double_divide(inverse(double_divide(X,inverse(Y))),inverse(X)) = Y,
inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).
cnf(14,plain,
double_divide(inverse(inverse(double_divide(X,inverse(X)))),inverse(Y)) = Y,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(17,plain,
double_divide(inverse(X),inverse(inverse(double_divide(Y,inverse(X))))) = Y,
inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).
cnf(23,plain,
double_divide(inverse(double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,inverse(X))),inverse(Z))))),U),inverse(Z))),U) = Y,
inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).
cnf(25,plain,
double_divide(inverse(X),inverse(inverse(inverse(double_divide(Y,inverse(Y)))))) = X,
inference('PARAMODULATE',[status(thm)],[13,14,theory(equality)]) ).
cnf(30,plain,
double_divide(inverse(X),inverse(inverse(Y))) = inverse(double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[13,17,theory(equality)]) ).
cnf(33,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[17,30,theory(equality)]) ).
cnf(34,plain,
inverse(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y)))))) = X,
inference('REWRITE',[status(thm)],[25,30,theory(equality)]) ).
cnf(35,plain,
inverse(double_divide(double_divide(X,inverse(Y)),X)) = Y,
inference('PARAMODULATE',[status(thm)],[33,33,theory(equality)]) ).
cnf(38,plain,
double_divide(inverse(double_divide(double_divide(X,Y),Z)),Y) = double_divide(Z,inverse(X)),
inference('PARAMODULATE',[status(thm)],[single_axiom,33,theory(equality)]) ).
cnf(39,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(double_divide(inverse(double_divide(Z,inverse(Y))),inverse(X))))))) = Z,
inference('REWRITE',[status(thm)],[23,30,38,theory(equality)]) ).
cnf(44,plain,
double_divide(inverse(double_divide(X,Y)),inverse(X)) = double_divide(Z,inverse(double_divide(Y,inverse(Z)))),
inference('PARAMODULATE',[status(thm)],[13,33,theory(equality)]) ).
cnf(49,plain,
double_divide(inverse(double_divide(double_divide(X,inverse(double_divide(Y,inverse(X)))),inverse(Z))),Y) = Z,
inference('PARAMODULATE',[status(thm)],[13,33,theory(equality)]) ).
cnf(52,plain,
inverse(double_divide(X,Y)) = double_divide(inverse(X),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[33,35,theory(equality)]) ).
cnf(58,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(inverse(double_divide(double_divide(Z,inverse(Y)),X))))))) = Z,
inference('REWRITE',[status(thm)],[39,52,theory(equality)]) ).
cnf(62,plain,
inverse(double_divide(double_divide(X,inverse(X)),Y)) = Y,
inference('REWRITE',[status(thm)],[7,52,theory(equality)]) ).
cnf(64,plain,
inverse(double_divide(double_divide(X,Y),X)) = double_divide(Z,inverse(double_divide(Y,inverse(Z)))),
inference('REWRITE',[status(thm)],[44,52,theory(equality)]) ).
cnf(69,plain,
inverse(double_divide(double_divide(X,Y),X)) = double_divide(double_divide(Z,inverse(Y)),Z),
inference('PARAMODULATE',[status(thm)],[35,35,theory(equality)]) ).
cnf(70,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(Y)),X),inverse(double_divide(Z,Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[33,35,theory(equality)]) ).
cnf(71,plain,
inverse(double_divide(X,inverse(X))) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[33,62,theory(equality)]) ).
cnf(84,plain,
inverse(double_divide(X,double_divide(Y,inverse(double_divide(Z,inverse(Y)))))) = double_divide(inverse(X),Z),
inference('PARAMODULATE',[status(thm)],[52,33,theory(equality)]) ).
cnf(92,plain,
inverse(double_divide(X,double_divide(Y,inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[33,71,theory(equality)]) ).
cnf(100,plain,
X = double_divide(inverse(X),double_divide(Y,inverse(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,71,theory(equality)]),92,theory(equality)]) ).
cnf(101,plain,
X = double_divide(double_divide(Y,inverse(Y)),inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,71,theory(equality)]),62,theory(equality)]) ).
cnf(116,plain,
inverse(double_divide(double_divide(X,double_divide(Y,inverse(Y))),inverse(double_divide(Z,X)))) = Z,
inference('PARAMODULATE',[status(thm)],[33,92,theory(equality)]) ).
cnf(170,plain,
inverse(double_divide(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y))))),Z)) = double_divide(X,inverse(Z)),
inference('PARAMODULATE',[status(thm)],[52,34,theory(equality)]) ).
cnf(203,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,92,theory(equality)]),101,theory(equality)]) ).
cnf(205,plain,
double_divide(double_divide(X,double_divide(Y,inverse(Y))),Z) = double_divide(Z,inverse(X)),
inference('PARAMODULATE',[status(thm)],[100,38,theory(equality)]) ).
cnf(206,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[116,203,52,205,theory(equality)]) ).
cnf(208,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[170,205,206,theory(equality)]) ).
cnf(210,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(inverse(X),Y),
inference('REWRITE',[status(thm)],[84,203,208,theory(equality)]) ).
cnf(217,plain,
inverse(double_divide(double_divide(X,Y),X)) = inverse(Y),
inference('REWRITE',[status(thm)],[64,203,208,theory(equality)]) ).
cnf(218,plain,
inverse(X) = double_divide(double_divide(Y,inverse(X)),Y),
inference('REWRITE',[status(thm)],[69,217,theory(equality)]) ).
cnf(219,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('REWRITE',[status(thm)],[70,206,52,218,theory(equality)]) ).
cnf(225,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[49,206,52,203,208,theory(equality)]) ).
cnf(226,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[4,210,206,208,theory(equality)]) ).
cnf(229,plain,
double_divide(double_divide(X,double_divide(double_divide(Y,inverse(X)),Z)),inverse(Z)) = Y,
inference('REWRITE',[status(thm)],[58,208,206,theory(equality)]) ).
cnf(235,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[219,203,theory(equality)]) ).
cnf(239,plain,
double_divide(double_divide(a3,b3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('PARAMODULATE',[status(thm)],[226,235,theory(equality)]) ).
cnf(290,plain,
double_divide(double_divide(X,double_divide(Y,Z)),inverse(Z)) = double_divide(inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[229,225,theory(equality)]) ).
cnf(312,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(X),double_divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[290,225,theory(equality)]) ).
cnf(317,plain,
$false,
inference('REWRITE',[status(thm)],[239,235,312,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 05:48:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:48:10
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n003.cluster.edu at 2022-06-14T05:48:10
% 0.49/0.66
% 0.49/0.66
% 0.49/0.66 #||
% 0.49/0.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.66 % SZS output start Refutation
% See solution above
% 0.49/0.67 ||#
% 0.49/0.67
% 0.49/0.67 ; Summary of computation:
% 0.49/0.67 ; 1692 formulas have been input or derived (from 47 formulas).
% 0.49/0.67 ; 317 (19%) were retained. Of these,
% 0.49/0.67 ; 218 (69%) were simplified or subsumed later,
% 0.49/0.67 ; 99 (31%) are still being kept.
% 0.49/0.67 ;
% 0.49/0.67 ; Run time in seconds excluding printing time:
% 0.49/0.67 ; 0.001 1% Read assertion file (1 call)
% 0.49/0.67 ; 0.000 0% Assert (3 calls)
% 0.49/0.67 ; 0.043 25% Process new row (1,587 calls)
% 0.49/0.67 ; 0.001 1% Resolution (92 calls)
% 0.49/0.67 ; 0.027 16% Paramodulation (46 calls)
% 0.49/0.67 ; 0.032 18% Forward simplification (1,482 calls)
% 0.49/0.67 ; 0.013 7% Backward simplification (316 calls)
% 0.49/0.67 ; 0.023 13% Ordering (5,905 calls)
% 0.49/0.67 ; 0.000 0% Sortal reasoning (32 calls)
% 0.49/0.67 ; 0.000 0% Purity testing (1 call)
% 0.49/0.67 ; 0.034 20% Other
% 0.49/0.67 ; 0.174 Total
% 0.49/0.67 ; 0.184 Real time
% 0.49/0.67 ;
% 0.49/0.67 ; Term-hash-array has 927 terms in all.
% 0.49/0.67 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.49/0.67 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.49/0.67 ; Path-index has 276 entries (477 at peak, 1,011 added, 735 deleted).
% 0.49/0.67 ; Path-index has 2,335 nodes (2,411 at peak, 3,293 added, 958 deleted).
% 0.49/0.67 ; Trie-index has 276 entries (477 at peak, 1,011 added, 735 deleted).
% 0.49/0.67 ; Trie-index has 1,088 nodes (2,201 at peak, 5,003 added, 3,915 deleted).
% 0.49/0.67 ; Retrieved 5,655 generalization terms in 10,179 calls.
% 0.49/0.67 ; Retrieved 1,495 instance terms in 423 calls.
% 0.49/0.67 ; Retrieved 3,407 unifiable terms in 350 calls.
% 0.49/0.67 ;
% 0.49/0.67 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.49/0.67 ; 2 with value 0
% 0.49/0.67 ; The agenda of rows to process has 48 entries:
% 0.49/0.67 ; 5 with value 24 8 with value 28 1 with value 31
% 0.49/0.67 ; 2 with value 25 2 with value 29 7 with value 32
% 0.49/0.67 ; 8 with value 26 5 with value 30 1 with value 34
% 0.49/0.67 ; 9 with value 27
% 0.49/0.67 ; The agenda of input rows to give has 1 entry:
% 0.49/0.67 ; 1 with value 16
% 0.49/0.67 ; The agenda of rows to give has 76 entries:
% 0.49/0.67 ; 2 with value (4 23) 12 with value (4 27) 1 with value (4 32)
% 0.49/0.67 ; 2 with value (4 24) 28 with value (4 28) 1 with value (4 36)
% 0.49/0.67 ; 2 with value (4 25) 7 with value (4 29) 1 with value (4 38)
% 0.49/0.67 ; 6 with value (4 26) 14 with value (4 30)
% 0.49/0.67 Evaluation took:
% 0.49/0.67 0.184 seconds of real time
% 0.49/0.67 0.153443 seconds of user run time
% 0.49/0.67 0.030208 seconds of system run time
% 0.49/0.67 [Run times include 0.006 seconds GC run time.]
% 0.49/0.67 0 calls to %EVAL
% 0.49/0.67 0 page faults and
% 0.49/0.67 14,511,432 bytes consed.
% 0.49/0.67 :PROOF-FOUND
% 0.49/0.67 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:48:10
% 0.49/0.67 :PROOF-FOUND
% 0.49/0.67 *
%------------------------------------------------------------------------------