TSTP Solution File: GRP602-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:37 EDT 2022
% Result : Unsatisfiable 0.47s 0.65s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 5 RR)
% Number of literals : 39 ( 38 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 108 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(inverse(double_divide(X,inverse(double_divide(Y,double_divide(X,Z))))),Z)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = inverse(double_divide(Y,X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(4,plain,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference('REWRITE',[status(thm)],[prove_these_axioms_2,multiply,theory(equality)]) ).
cnf(5,plain,
inverse(double_divide(inverse(double_divide(X,Y)),Z)) = inverse(double_divide(U,inverse(double_divide(Y,double_divide(U,double_divide(X,Z)))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
inverse(double_divide(inverse(double_divide(inverse(double_divide(X,Y)),Z)),double_divide(X,Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(7,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(Y,X)),double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(8,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(inverse(double_divide(Z,X)),U)),Y))) = double_divide(Z,U),
inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).
cnf(12,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,double_divide(Y,U)))) = U,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(13,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(Z,Y))) = double_divide(inverse(double_divide(U,Z)),double_divide(U,X)),
inference('PARAMODULATE',[status(thm)],[6,7,theory(equality)]) ).
cnf(24,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,inverse(double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[6,13,theory(equality)]) ).
cnf(25,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)) = double_divide(inverse(double_divide(U,Y)),double_divide(U,Z)),
inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).
cnf(26,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(X,Z))))) = Y,
inference('PARAMODULATE',[status(thm)],[7,13,theory(equality)]) ).
cnf(37,plain,
inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),U)),double_divide(inverse(double_divide(Z,V)),U))) = double_divide(Y,V),
inference('PARAMODULATE',[status(thm)],[6,13,theory(equality)]) ).
cnf(63,plain,
inverse(double_divide(inverse(X),double_divide(Y,double_divide(Y,inverse(double_divide(Z,X)))))) = Z,
inference('PARAMODULATE',[status(thm)],[6,24,theory(equality)]) ).
cnf(75,plain,
inverse(double_divide(X,double_divide(inverse(double_divide(inverse(double_divide(Y,Z)),X)),U))) = double_divide(Y,inverse(double_divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[7,24,theory(equality)]) ).
cnf(84,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(Y,Z)))),double_divide(X,U)),double_divide(U,V))) = double_divide(Y,inverse(double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[12,24,theory(equality)]) ).
cnf(120,plain,
inverse(double_divide(X,inverse(double_divide(inverse(double_divide(Y,Z)),double_divide(Y,Z))))) = X,
inference('PARAMODULATE',[status(thm)],[26,25,theory(equality)]) ).
cnf(144,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(double_divide(Z,double_divide(Z,inverse(double_divide(U,V)))),Y))) = double_divide(U,double_divide(inverse(V),X)),
inference('PARAMODULATE',[status(thm)],[13,63,theory(equality)]) ).
cnf(156,plain,
inverse(double_divide(X,inverse(double_divide(inverse(Y),Y)))) = X,
inference('PARAMODULATE',[status(thm)],[120,24,theory(equality)]) ).
cnf(164,plain,
inverse(double_divide(inverse(inverse(double_divide(inverse(X),X))),double_divide(Y,double_divide(Y,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[63,156,theory(equality)]) ).
cnf(167,plain,
double_divide(X,double_divide(X,Y)) = double_divide(Z,double_divide(Z,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,156,theory(equality)]),156,theory(equality)]) ).
cnf(182,plain,
inverse(double_divide(X,double_divide(X,double_divide(inverse(Y),inverse(double_divide(Z,Y)))))) = Z,
inference('PARAMODULATE',[status(thm)],[63,167,theory(equality)]) ).
cnf(188,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(U,double_divide(U,double_divide(X,inverse(double_divide(Y,Z))))),
inference('PARAMODULATE',[status(thm)],[167,24,theory(equality)]) ).
cnf(189,plain,
inverse(double_divide(inverse(double_divide(inverse(X),Y)),X)) = Y,
inference('REWRITE',[status(thm)],[182,188,theory(equality)]) ).
cnf(209,plain,
inverse(double_divide(X,double_divide(inverse(Y),X))) = Y,
inference('PARAMODULATE',[status(thm)],[189,189,theory(equality)]) ).
cnf(211,plain,
X = inverse(double_divide(inverse(inverse(double_divide(inverse(Y),Y))),X)),
inference('PARAMODULATE',[status(thm)],[156,189,theory(equality)]) ).
cnf(212,plain,
double_divide(X,double_divide(X,Y)) = Y,
inference('REWRITE',[status(thm)],[164,211,theory(equality)]) ).
cnf(226,plain,
inverse(double_divide(inverse(double_divide(X,Y)),double_divide(inverse(double_divide(Z,U)),Y))) = double_divide(Z,double_divide(inverse(U),X)),
inference('REWRITE',[status(thm)],[144,212,theory(equality)]) ).
cnf(228,plain,
double_divide(inverse(double_divide(X,Y)),double_divide(inverse(Z),Y)) = double_divide(X,Z),
inference('REWRITE',[status(thm)],[8,226,theory(equality)]) ).
cnf(232,plain,
inverse(double_divide(X,double_divide(Y,Z))) = double_divide(Y,double_divide(inverse(Z),X)),
inference('REWRITE',[status(thm)],[226,228,theory(equality)]) ).
cnf(240,plain,
inverse(inverse(double_divide(X,inverse(double_divide(Y,Z))))) = double_divide(Y,inverse(double_divide(Z,X))),
inference('REWRITE',[status(thm)],[75,212,232,theory(equality)]) ).
cnf(242,plain,
inverse(inverse(inverse(double_divide(inverse(b2),inverse(double_divide(a2,b2)))))) != a2,
inference('REWRITE',[status(thm)],[4,240,theory(equality)]) ).
cnf(275,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[209,212,232,theory(equality)]) ).
cnf(306,plain,
inverse(double_divide(inverse(b2),inverse(double_divide(a2,b2)))) != a2,
inference('REWRITE',[status(thm)],[242,275,theory(equality)]) ).
cnf(325,plain,
inverse(double_divide(double_divide(inverse(double_divide(X,Y)),double_divide(X,Z)),double_divide(Z,U))) = double_divide(Y,U),
inference('REWRITE',[status(thm)],[37,228,theory(equality)]) ).
cnf(327,plain,
double_divide(inverse(double_divide(X,Y)),Z) = double_divide(X,inverse(double_divide(Y,Z))),
inference('REWRITE',[status(thm)],[84,325,theory(equality)]) ).
cnf(331,plain,
inverse(double_divide(inverse(X),inverse(double_divide(Y,X)))) = Y,
inference('REWRITE',[status(thm)],[189,327,theory(equality)]) ).
cnf(332,plain,
$false,
inference('REWRITE',[status(thm)],[306,331,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n027.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 23:13:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:13:33
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-13T23:13:33
% 0.47/0.65
% 0.47/0.65
% 0.47/0.65 #||
% 0.47/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65 % SZS output start Refutation
% See solution above
% 0.49/0.66 ||#
% 0.49/0.66
% 0.49/0.66 ; Summary of computation:
% 0.49/0.66 ; 649 formulas have been input or derived (from 17 formulas).
% 0.49/0.66 ; 332 (51%) were retained. Of these,
% 0.49/0.66 ; 186 (56%) were simplified or subsumed later,
% 0.49/0.66 ; 146 (44%) are still being kept.
% 0.49/0.66 ;
% 0.49/0.66 ; Run time in seconds excluding printing time:
% 0.49/0.66 ; 0.001 1% Read assertion file (1 call)
% 0.49/0.66 ; 0.000 0% Assert (3 calls)
% 0.49/0.66 ; 0.049 28% Process new row (565 calls)
% 0.49/0.66 ; 0.002 1% Resolution (32 calls)
% 0.49/0.66 ; 0.017 10% Paramodulation (16 calls)
% 0.49/0.66 ; 0.031 18% Forward simplification (534 calls)
% 0.49/0.66 ; 0.021 12% Backward simplification (331 calls)
% 0.49/0.66 ; 0.025 15% Ordering (2,234 calls)
% 0.49/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.49/0.66 ; 0.001 1% Purity testing (1 call)
% 0.49/0.66 ; 0.025 15% Other
% 0.49/0.66 ; 0.172 Total
% 0.49/0.66 ; 0.185 Real time
% 0.49/0.66 ;
% 0.49/0.66 ; Term-hash-array has 1,725 terms in all.
% 0.49/0.66 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.49/0.66 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.49/0.66 ; Path-index has 783 entries (1,192 at peak, 1,866 added, 1,083 deleted).
% 0.49/0.66 ; Path-index has 3,436 nodes (3,750 at peak, 4,443 added, 1,007 deleted).
% 0.49/0.66 ; Trie-index has 783 entries (1,192 at peak, 1,866 added, 1,083 deleted).
% 0.49/0.66 ; Trie-index has 3,535 nodes (5,057 at peak, 8,128 added, 4,593 deleted).
% 0.49/0.66 ; Retrieved 1,122 generalization terms in 5,184 calls.
% 0.49/0.66 ; Retrieved 2,404 instance terms in 374 calls.
% 0.49/0.66 ; Retrieved 2,588 unifiable terms in 147 calls.
% 0.49/0.66 ;
% 0.49/0.66 ; The agenda of backward simplifiable rows to process has 42 entries:
% 0.49/0.66 ; 42 with value 0
% 0.49/0.66 ; The agenda of rows to process has 38 entries:
% 0.49/0.66 ; 2 with value 28 1 with value 33 1 with value 38
% 0.49/0.66 ; 2 with value 29 3 with value 34 1 with value 39
% 0.49/0.66 ; 7 with value 30 5 with value 35 2 with value 40
% 0.49/0.66 ; 2 with value 31 1 with value 36 1 with value 41
% 0.49/0.66 ; 4 with value 32 5 with value 37 1 with value 43
% 0.49/0.66 ; The agenda of input rows to give has 1 entry:
% 0.49/0.66 ; 1 with value 21
% 0.49/0.66 ; The agenda of rows to give has 138 entries:
% 0.49/0.66 ; 3 with value (4 18) 5 with value (4 29) 7 with value (4 36)
% 0.49/0.66 ; 1 with value (4 20) 4 with value (4 30) 15 with value (4 37)
% 0.49/0.66 ; 1 with value (4 22) 5 with value (4 31) 12 with value (4 38)
% 0.49/0.66 ; 2 with value (4 23) 6 with value (4 32) 8 with value (4 39)
% 0.49/0.66 ; 7 with value (4 24) 6 with value (4 33) 9 with value (4 40)
% 0.49/0.66 ; 2 with value (4 25) 15 with value (4 34) 9 with value (4 41)
% 0.49/0.66 ; 5 with value (4 26) 11 with value (4 35) 1 with value (4 43)
% 0.49/0.66 ; 4 with value (4 28)
% 0.49/0.66 Evaluation took:
% 0.49/0.66 0.185 seconds of real time
% 0.49/0.66 0.167657 seconds of user run time
% 0.49/0.66 0.01787 seconds of system run time
% 0.49/0.66 [Run times include 0.01 seconds GC run time.]
% 0.49/0.66 0 calls to %EVAL
% 0.49/0.66 0 page faults and
% 0.49/0.66 14,392,320 bytes consed.
% 0.49/0.66 :PROOF-FOUND
% 0.49/0.66 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T23:13:33
% 0.49/0.66 :PROOF-FOUND
% 0.49/0.66 *
%------------------------------------------------------------------------------