TSTP Solution File: GRP608-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP608-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:38 EDT 2022
% Result : Unsatisfiable 0.40s 0.59s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 3 RR)
% Number of literals : 46 ( 45 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 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 : 138 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),Z) = Y,
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_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(4,plain,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
inference('REWRITE',[status(thm)],[prove_these_axioms_4,multiply,theory(equality)]) ).
cnf(5,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(U,inverse(double_divide(inverse(Y),double_divide(U,double_divide(X,Z))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(double_divide(inverse(Y),double_divide(X,Z))))),inverse(double_divide(inverse(U),Y)))),Z) = U,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),Z)),double_divide(X,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(12,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(Y,inverse(X))),double_divide(Y,inverse(Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(14,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(double_divide(Z,inverse(double_divide(inverse(X),double_divide(Z,inverse(U)))))),Y)) = U,
inference('PARAMODULATE',[status(thm)],[7,single_axiom,theory(equality)]) ).
cnf(21,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),X) = Z,
inference('PARAMODULATE',[status(thm)],[12,single_axiom,theory(equality)]) ).
cnf(31,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(U,double_divide(U,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,21,theory(equality)]) ).
cnf(36,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(U))))),U))),X) = Y,
inference('PARAMODULATE',[status(thm)],[21,21,theory(equality)]) ).
cnf(37,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),inverse(U))),X)),Z) = U,
inference('PARAMODULATE',[status(thm)],[7,21,theory(equality)]) ).
cnf(38,plain,
double_divide(inverse(X),double_divide(inverse(double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(U))))),inverse(X))),U)) = Y,
inference('PARAMODULATE',[status(thm)],[12,21,theory(equality)]) ).
cnf(42,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(inverse(double_divide(Z,inverse(U))),V)))),X) = double_divide(inverse(U),double_divide(Y,double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[21,5,theory(equality)]) ).
cnf(50,plain,
double_divide(inverse(double_divide(X,inverse(Y))),inverse(Z)) = double_divide(inverse(double_divide(X,double_divide(U,double_divide(U,inverse(Y))))),double_divide(V,double_divide(V,inverse(Z)))),
inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]) ).
cnf(53,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),double_divide(inverse(double_divide(inverse(inverse(Y)),double_divide(U,double_divide(U,inverse(V))))),V)),
inference('PARAMODULATE',[status(thm)],[31,21,theory(equality)]) ).
cnf(68,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),inverse(Z))),U) = double_divide(inverse(double_divide(inverse(double_divide(X,U)),inverse(Y))),inverse(Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[31,31,theory(equality)]),50,theory(equality)]) ).
cnf(73,plain,
double_divide(inverse(double_divide(inverse(double_divide(X,Y)),inverse(double_divide(inverse(Z),double_divide(X,Y))))),inverse(double_divide(inverse(U),Z))) = U,
inference('REWRITE',[status(thm)],[6,68,theory(equality)]) ).
cnf(80,plain,
double_divide(inverse(double_divide(inverse(X),inverse(double_divide(inverse(Y),X)))),inverse(double_divide(inverse(Z),Y))) = Z,
inference('PARAMODULATE',[status(thm)],[73,73,theory(equality)]) ).
cnf(81,plain,
double_divide(inverse(X),double_divide(inverse(Y),inverse(double_divide(inverse(X),Z)))) = double_divide(inverse(Z),Y),
inference('PARAMODULATE',[status(thm)],[7,80,theory(equality)]) ).
cnf(82,plain,
double_divide(inverse(double_divide(inverse(X),inverse(double_divide(inverse(Y),X)))),inverse(Z)) = double_divide(U,inverse(double_divide(inverse(Z),double_divide(U,Y)))),
inference('PARAMODULATE',[status(thm)],[80,single_axiom,theory(equality)]) ).
cnf(83,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(double_divide(inverse(Z),inverse(double_divide(inverse(U),Z)))),Y)) = double_divide(inverse(X),U),
inference('PARAMODULATE',[status(thm)],[7,80,theory(equality)]) ).
cnf(90,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X,inverse(Y))),double_divide(X,inverse(Z)))),inverse(Z))),inverse(double_divide(inverse(U),Y))) = U,
inference('PARAMODULATE',[status(thm)],[80,12,theory(equality)]) ).
cnf(105,plain,
double_divide(inverse(X),double_divide(inverse(Y),Z)) = double_divide(inverse(double_divide(inverse(Z),inverse(X))),Y),
inference('PARAMODULATE',[status(thm)],[12,81,theory(equality)]) ).
cnf(106,plain,
double_divide(inverse(X),double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(inverse(Z)),double_divide(U,double_divide(U,inverse(Y))))))) = Z,
inference('REWRITE',[status(thm)],[38,105,theory(equality)]) ).
cnf(107,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(Y),double_divide(inverse(Y),double_divide(Z,double_divide(Z,inverse(U))))))),U) = X,
inference('REWRITE',[status(thm)],[37,105,theory(equality)]) ).
cnf(117,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(inverse(Y),Z))),X) = double_divide(inverse(Z),Y),
inference('PARAMODULATE',[status(thm)],[21,81,theory(equality)]) ).
cnf(118,plain,
double_divide(inverse(X),double_divide(inverse(inverse(Y)),double_divide(Z,double_divide(Z,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[36,117,theory(equality)]) ).
cnf(119,plain,
double_divide(inverse(X),double_divide(inverse(X),Y)) = Y,
inference('REWRITE',[status(thm)],[106,118,theory(equality)]) ).
cnf(121,plain,
double_divide(inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(Z))))),Z) = X,
inference('REWRITE',[status(thm)],[107,119,theory(equality)]) ).
cnf(122,plain,
double_divide(inverse(double_divide(X,inverse(Y))),Z) = double_divide(inverse(double_divide(X,Z)),inverse(Y)),
inference('REWRITE',[status(thm)],[53,121,theory(equality)]) ).
cnf(126,plain,
double_divide(inverse(X),inverse(double_divide(inverse(Y),X))) = Y,
inference('REWRITE',[status(thm)],[90,7,122,theory(equality)]) ).
cnf(133,plain,
double_divide(inverse(double_divide(inverse(X),Y)),double_divide(inverse(Z),Y)) = double_divide(inverse(X),Z),
inference('REWRITE',[status(thm)],[83,126,theory(equality)]) ).
cnf(134,plain,
double_divide(inverse(X),double_divide(Y,inverse(double_divide(inverse(X),double_divide(Y,inverse(Z)))))) = Z,
inference('REWRITE',[status(thm)],[14,133,theory(equality)]) ).
cnf(137,plain,
double_divide(inverse(X),inverse(Y)) = double_divide(Z,inverse(double_divide(inverse(Y),double_divide(Z,X)))),
inference('REWRITE',[status(thm)],[82,126,theory(equality)]) ).
cnf(138,plain,
double_divide(inverse(X),double_divide(inverse(inverse(Y)),inverse(X))) = Y,
inference('REWRITE',[status(thm)],[134,137,theory(equality)]) ).
cnf(174,plain,
inverse(double_divide(inverse(X),Y)) = double_divide(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[81,119,theory(equality)]) ).
cnf(176,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(Y,inverse(Z))),U))) = double_divide(inverse(Z),double_divide(X,double_divide(Y,U))),
inference('REWRITE',[status(thm)],[42,119,174,theory(equality)]) ).
cnf(178,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[12,119,176,theory(equality)]) ).
cnf(180,plain,
double_divide(inverse(X),double_divide(Y,inverse(X))) = Y,
inference('REWRITE',[status(thm)],[138,178,theory(equality)]) ).
cnf(191,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('PARAMODULATE',[status(thm)],[119,178,theory(equality)]) ).
cnf(193,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[180,178,theory(equality)]) ).
cnf(194,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[193,193,theory(equality)]) ).
cnf(195,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[194,191,theory(equality)]) ).
cnf(197,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,195,theory(equality)]),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP608-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 10:26:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T10:26:39
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-13T10:26:39
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 #||
% 0.40/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.59 % SZS output start Refutation
% See solution above
% 0.40/0.59 ||#
% 0.40/0.59
% 0.40/0.59 ; Summary of computation:
% 0.40/0.59 ; 378 formulas have been input or derived (from 19 formulas).
% 0.40/0.59 ; 197 (52%) were retained. Of these,
% 0.40/0.59 ; 133 (68%) were simplified or subsumed later,
% 0.40/0.59 ; 64 (32%) are still being kept.
% 0.40/0.59 ;
% 0.40/0.59 ; Run time in seconds excluding printing time:
% 0.40/0.59 ; 0.001 1% Read assertion file (1 call)
% 0.40/0.59 ; 0.001 1% Assert (3 calls)
% 0.40/0.59 ; 0.030 24% Process new row (372 calls)
% 0.40/0.59 ; 0.001 1% Resolution (36 calls)
% 0.40/0.59 ; 0.007 6% Paramodulation (18 calls)
% 0.40/0.59 ; 0.014 11% Forward simplification (313 calls)
% 0.40/0.59 ; 0.020 16% Backward simplification (196 calls)
% 0.40/0.59 ; 0.025 20% Ordering (1,886 calls)
% 0.40/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.40/0.59 ; 0.000 0% Purity testing (1 call)
% 0.40/0.59 ; 0.024 20% Other
% 0.40/0.59 ; 0.123 Total
% 0.40/0.59 ; 0.129 Real time
% 0.40/0.59 ;
% 0.40/0.59 ; Term-hash-array has 933 terms in all.
% 0.40/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.40/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.40/0.59 ; Path-index has 351 entries (615 at peak, 993 added, 642 deleted).
% 0.40/0.59 ; Path-index has 1,213 nodes (1,267 at peak, 1,621 added, 408 deleted).
% 0.40/0.59 ; Trie-index has 351 entries (615 at peak, 993 added, 642 deleted).
% 0.40/0.59 ; Trie-index has 1,380 nodes (2,896 at peak, 4,594 added, 3,214 deleted).
% 0.40/0.59 ; Retrieved 944 generalization terms in 2,068 calls.
% 0.40/0.59 ; Retrieved 1,480 instance terms in 242 calls.
% 0.40/0.59 ; Retrieved 1,820 unifiable terms in 147 calls.
% 0.40/0.59 ;
% 0.40/0.59 ; The agenda of rows to process has 3 entries:
% 0.40/0.59 ; 3 with value 20
% 0.40/0.59 ; The agenda of rows to give has 56 entries:
% 0.40/0.59 ; 1 with value (4 17) 5 with value (4 27) 2 with value (4 35)
% 0.40/0.59 ; 2 with value (4 19) 2 with value (4 28) 10 with value (4 36)
% 0.40/0.59 ; 1 with value (4 20) 1 with value (4 30) 3 with value (4 37)
% 0.40/0.59 ; 2 with value (4 23) 3 with value (4 31) 2 with value (4 38)
% 0.40/0.59 ; 1 with value (4 24) 2 with value (4 32) 3 with value (4 39)
% 0.40/0.59 ; 2 with value (4 25) 3 with value (4 33) 2 with value (4 40)
% 0.40/0.59 ; 4 with value (4 26) 4 with value (4 34) 1 with value (4 43)
% 0.40/0.59 Evaluation took:
% 0.40/0.59 0.129 seconds of real time
% 0.40/0.59 0.117158 seconds of user run time
% 0.40/0.59 0.011737 seconds of system run time
% 0.40/0.59 0 calls to %EVAL
% 0.40/0.59 0 page faults and
% 0.40/0.59 11,993,568 bytes consed.
% 0.40/0.59 :PROOF-FOUND
% 0.40/0.59 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T10:26:39
% 0.40/0.59 :PROOF-FOUND
% 0.40/0.59 *
%------------------------------------------------------------------------------