TSTP Solution File: GRP105-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP105-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:36:10 EDT 2022
% Result : Unsatisfiable 0.47s 0.65s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 54 ( 49 unt; 0 nHn; 8 RR)
% Number of literals : 64 ( 63 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 111 ( 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,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(4,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[prove_these_axioms,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(29,plain,
X = inverse(double_divide(X,inverse(double_divide(Y,inverse(Y))))),
inference('PARAMODULATE',[status(thm)],[7,17,theory(equality)]) ).
cnf(30,plain,
( inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1)))
| inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[4,29,theory(equality)]) ).
cnf(31,plain,
double_divide(inverse(X),inverse(inverse(Y))) = inverse(double_divide(X,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[13,17,theory(equality)]) ).
cnf(34,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[17,31,theory(equality)]) ).
cnf(35,plain,
inverse(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y)))))) = X,
inference('REWRITE',[status(thm)],[25,31,theory(equality)]) ).
cnf(36,plain,
inverse(double_divide(double_divide(X,inverse(Y)),X)) = Y,
inference('PARAMODULATE',[status(thm)],[34,34,theory(equality)]) ).
cnf(37,plain,
inverse(double_divide(X,inverse(X))) = inverse(double_divide(Y,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[34,7,theory(equality)]) ).
cnf(38,plain,
( inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[30,37,theory(equality)]) ).
cnf(40,plain,
double_divide(inverse(double_divide(double_divide(X,Y),Z)),Y) = double_divide(Z,inverse(X)),
inference('PARAMODULATE',[status(thm)],[single_axiom,34,theory(equality)]) ).
cnf(41,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,31,40,theory(equality)]) ).
cnf(46,plain,
double_divide(inverse(double_divide(X,Y)),inverse(X)) = double_divide(Z,inverse(double_divide(Y,inverse(Z)))),
inference('PARAMODULATE',[status(thm)],[13,34,theory(equality)]) ).
cnf(51,plain,
double_divide(inverse(double_divide(double_divide(X,inverse(double_divide(Y,inverse(X)))),inverse(Z))),Y) = Z,
inference('PARAMODULATE',[status(thm)],[13,34,theory(equality)]) ).
cnf(54,plain,
inverse(double_divide(X,Y)) = double_divide(inverse(X),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[34,36,theory(equality)]) ).
cnf(60,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(inverse(double_divide(double_divide(Z,inverse(Y)),X))))))) = Z,
inference('REWRITE',[status(thm)],[41,54,theory(equality)]) ).
cnf(64,plain,
inverse(double_divide(double_divide(X,inverse(X)),Y)) = Y,
inference('REWRITE',[status(thm)],[7,54,theory(equality)]) ).
cnf(66,plain,
inverse(double_divide(double_divide(X,Y),X)) = double_divide(Z,inverse(double_divide(Y,inverse(Z)))),
inference('REWRITE',[status(thm)],[46,54,theory(equality)]) ).
cnf(71,plain,
inverse(double_divide(double_divide(X,Y),X)) = double_divide(double_divide(Z,inverse(Y)),Z),
inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).
cnf(72,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(Y)),X),inverse(double_divide(Z,Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[34,36,theory(equality)]) ).
cnf(73,plain,
inverse(double_divide(X,inverse(X))) = double_divide(Y,inverse(Y)),
inference('PARAMODULATE',[status(thm)],[34,64,theory(equality)]) ).
cnf(86,plain,
inverse(double_divide(X,double_divide(Y,inverse(double_divide(Z,inverse(Y)))))) = double_divide(inverse(X),Z),
inference('PARAMODULATE',[status(thm)],[54,34,theory(equality)]) ).
cnf(94,plain,
inverse(double_divide(X,double_divide(Y,inverse(Y)))) = X,
inference('PARAMODULATE',[status(thm)],[34,73,theory(equality)]) ).
cnf(102,plain,
X = double_divide(inverse(X),double_divide(Y,inverse(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,73,theory(equality)]),94,theory(equality)]) ).
cnf(103,plain,
X = double_divide(double_divide(Y,inverse(Y)),inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,73,theory(equality)]),64,theory(equality)]) ).
cnf(118,plain,
inverse(double_divide(double_divide(X,double_divide(Y,inverse(Y))),inverse(double_divide(Z,X)))) = Z,
inference('PARAMODULATE',[status(thm)],[34,94,theory(equality)]) ).
cnf(172,plain,
inverse(double_divide(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y))))),Z)) = double_divide(X,inverse(Z)),
inference('PARAMODULATE',[status(thm)],[54,35,theory(equality)]) ).
cnf(205,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[40,94,theory(equality)]),103,theory(equality)]) ).
cnf(207,plain,
double_divide(double_divide(X,double_divide(Y,inverse(Y))),Z) = double_divide(Z,inverse(X)),
inference('PARAMODULATE',[status(thm)],[102,40,theory(equality)]) ).
cnf(208,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[118,205,54,207,theory(equality)]) ).
cnf(210,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(Y,inverse(X)),
inference('REWRITE',[status(thm)],[172,207,208,theory(equality)]) ).
cnf(212,plain,
inverse(double_divide(X,inverse(Y))) = double_divide(inverse(X),Y),
inference('REWRITE',[status(thm)],[86,205,210,theory(equality)]) ).
cnf(219,plain,
inverse(double_divide(double_divide(X,Y),X)) = inverse(Y),
inference('REWRITE',[status(thm)],[66,205,210,theory(equality)]) ).
cnf(220,plain,
inverse(X) = double_divide(double_divide(Y,inverse(X)),Y),
inference('REWRITE',[status(thm)],[71,219,theory(equality)]) ).
cnf(221,plain,
double_divide(X,double_divide(Y,X)) = Y,
inference('REWRITE',[status(thm)],[72,208,54,220,theory(equality)]) ).
cnf(227,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[51,208,54,205,210,theory(equality)]) ).
cnf(228,plain,
( double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3))
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[38,212,208,210,theory(equality)]) ).
cnf(231,plain,
double_divide(double_divide(X,double_divide(double_divide(Y,inverse(X)),Z)),inverse(Z)) = Y,
inference('REWRITE',[status(thm)],[60,210,208,theory(equality)]) ).
cnf(237,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('PARAMODULATE',[status(thm)],[221,205,theory(equality)]) ).
cnf(239,plain,
inverse(double_divide(X,Y)) = inverse(double_divide(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,237,theory(equality)]),54,theory(equality)]) ).
cnf(240,plain,
double_divide(double_divide(b3,a3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('REWRITE',[status(thm)],[228,239,theory(equality)]) ).
cnf(241,plain,
double_divide(double_divide(a3,b3),inverse(c3)) != double_divide(double_divide(c3,b3),inverse(a3)),
inference('PARAMODULATE',[status(thm)],[240,237,theory(equality)]) ).
cnf(293,plain,
double_divide(double_divide(X,double_divide(Y,Z)),inverse(Z)) = double_divide(inverse(X),Y),
inference('PARAMODULATE',[status(thm)],[231,227,theory(equality)]) ).
cnf(315,plain,
double_divide(double_divide(X,Y),inverse(Z)) = double_divide(inverse(X),double_divide(Z,Y)),
inference('PARAMODULATE',[status(thm)],[293,227,theory(equality)]) ).
cnf(320,plain,
$false,
inference('REWRITE',[status(thm)],[241,237,315,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP105-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 11:47:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 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/sandbox2/benchmark/theBenchmark.p 2022-06-13T11:47:40
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-13T11:47:40
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.47/0.66 ||#
% 0.47/0.66
% 0.47/0.66 ; Summary of computation:
% 0.47/0.66 ; 1707 formulas have been input or derived (from 50 formulas).
% 0.47/0.66 ; 320 (19%) were retained. Of these,
% 0.47/0.66 ; 221 (69%) were simplified or subsumed later,
% 0.47/0.66 ; 99 (31%) are still being kept.
% 0.47/0.66 ;
% 0.47/0.66 ; Run time in seconds excluding printing time:
% 0.47/0.66 ; 0.001 1% Read assertion file (1 call)
% 0.47/0.66 ; 0.001 1% Assert (3 calls)
% 0.47/0.66 ; 0.028 16% Process new row (1,598 calls)
% 0.47/0.66 ; 0.001 1% Resolution (98 calls)
% 0.47/0.66 ; 0.029 16% Paramodulation (49 calls)
% 0.47/0.66 ; 0.000 0% Condensing (4 calls)
% 0.47/0.66 ; 0.002 1% Forward subsumption (4 calls)
% 0.47/0.66 ; 0.000 0% Backward subsumption (4 calls)
% 0.47/0.66 ; 0.039 22% Forward simplification (1,481 calls)
% 0.47/0.66 ; 0.017 10% Backward simplification (319 calls)
% 0.47/0.66 ; 0.029 16% Ordering (5,911 calls)
% 0.47/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.66 ; 0.000 0% Purity testing (1 call)
% 0.47/0.66 ; 0.029 16% Other
% 0.47/0.66 ; 0.176 Total
% 0.47/0.66 ; 0.189 Real time
% 0.47/0.66 ;
% 0.47/0.66 ; Term-hash-array has 945 terms in all.
% 0.47/0.66 ; Feature-vector-row-index has 0 entries (1 at peak, 4 added, 4 deleted).
% 0.47/0.66 ; Feature-vector-row-index has 1 node (36 at peak, 111 added, 110 deleted).
% 0.47/0.66 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.47/0.66 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.47/0.66 ; Path-index has 277 entries (485 at peak, 1,100 added, 823 deleted).
% 0.47/0.66 ; Path-index has 2,336 nodes (2,426 at peak, 3,470 added, 1,134 deleted).
% 0.47/0.66 ; Trie-index has 277 entries (485 at peak, 1,100 added, 823 deleted).
% 0.47/0.66 ; Trie-index has 1,089 nodes (2,218 at peak, 5,247 added, 4,158 deleted).
% 0.47/0.66 ; Retrieved 5,637 generalization terms in 10,166 calls.
% 0.47/0.66 ; Retrieved 1,496 instance terms in 422 calls.
% 0.47/0.66 ; Retrieved 3,655 unifiable terms in 437 calls.
% 0.47/0.66 ;
% 0.47/0.66 ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.47/0.66 ; 2 with value 0
% 0.47/0.66 ; The agenda of rows to process has 48 entries:
% 0.47/0.66 ; 5 with value 24 8 with value 28 1 with value 31
% 0.47/0.66 ; 2 with value 25 2 with value 29 7 with value 32
% 0.47/0.66 ; 8 with value 26 5 with value 30 1 with value 34
% 0.47/0.66 ; 9 with value 27
% 0.47/0.66 ; The agenda of input rows to give has 1 entry:
% 0.47/0.66 ; 1 with value 16
% 0.47/0.66 ; The agenda of rows to give has 76 entries:
% 0.47/0.66 ; 2 with value (4 23) 12 with value (4 27) 1 with value (4 32)
% 0.47/0.66 ; 2 with value (4 24) 28 with value (4 28) 1 with value (4 36)
% 0.47/0.66 ; 2 with value (4 25) 7 with value (4 29) 1 with value (4 38)
% 0.47/0.66 ; 6 with value (4 26) 14 with value (4 30)
% 0.47/0.66 Evaluation took:
% 0.47/0.66 0.189 seconds of real time
% 0.47/0.66 0.16299 seconds of user run time
% 0.47/0.66 0.02606 seconds of system run time
% 0.47/0.66 [Run times include 0.007 seconds GC run time.]
% 0.47/0.66 0 calls to %EVAL
% 0.47/0.66 0 page faults and
% 0.47/0.66 15,798,776 bytes consed.
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T11:47:40
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 *
%------------------------------------------------------------------------------