TSTP Solution File: GRP593-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP593-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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.41s 0.60s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 17 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,inverse(double_divide(Z,Y)))))) = Z,
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_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference('REWRITE',[status(thm)],[prove_these_axioms_1,multiply,theory(equality)]) ).
cnf(5,plain,
inverse(double_divide(double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))),Z)) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(8,plain,
inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))) = double_divide(double_divide(Z,U),inverse(double_divide(Y,U))),
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(15,plain,
double_divide(double_divide(inverse(double_divide(X,Y)),Z),inverse(double_divide(Y,Z))) = X,
inference('PARAMODULATE',[status(thm)],[single_axiom,8,theory(equality)]) ).
cnf(16,plain,
double_divide(double_divide(X,Y),inverse(double_divide(Z,Y))) = double_divide(double_divide(X,U),inverse(double_divide(Z,U))),
inference('PARAMODULATE',[status(thm)],[8,8,theory(equality)]) ).
cnf(17,plain,
inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))),Y)) = Z,
inference('PARAMODULATE',[status(thm)],[5,8,theory(equality)]) ).
cnf(44,plain,
inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),Z),inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,15,theory(equality)]) ).
cnf(87,plain,
inverse(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Y)))),Z)) = Z,
inference('PARAMODULATE',[status(thm)],[17,16,theory(equality)]) ).
cnf(122,plain,
inverse(double_divide(inverse(double_divide(X,inverse(X))),Y)) = Y,
inference('PARAMODULATE',[status(thm)],[87,15,theory(equality)]) ).
cnf(133,plain,
double_divide(double_divide(X,Y),Y) = double_divide(double_divide(X,Z),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,122,theory(equality)]),122,theory(equality)]) ).
cnf(146,plain,
inverse(double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),inverse(X)),Z),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[44,133,theory(equality)]) ).
cnf(151,plain,
double_divide(X,inverse(double_divide(Y,Z))) = double_divide(double_divide(double_divide(inverse(double_divide(X,Y)),Z),U),U),
inference('PARAMODULATE',[status(thm)],[133,15,theory(equality)]) ).
cnf(152,plain,
inverse(double_divide(X,inverse(double_divide(Y,inverse(X))))) = Y,
inference('REWRITE',[status(thm)],[146,151,theory(equality)]) ).
cnf(171,plain,
inverse(double_divide(X,inverse(X))) = inverse(double_divide(Y,inverse(Y))),
inference('PARAMODULATE',[status(thm)],[152,122,theory(equality)]) ).
cnf(172,plain,
$false,
inference('REWRITE',[status(thm)],[4,171,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP593-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 10:42:33 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.51 #<PACKAGE "SNARK-USER">
% 0.22/0.51 *
% 0.22/0.51 SNARK-TPTP-OPTIONS
% 0.22/0.51 *
% 0.22/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.51 (USE-FACTORING :POS)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.51 *
% 0.22/0.51 "."
% 0.22/0.51 *
% 0.22/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T10:42:33
% 0.22/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-14T10:42:33
% 0.41/0.60
% 0.41/0.60
% 0.41/0.60 #||
% 0.41/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.60 % SZS output start Refutation
% See solution above
% 0.41/0.60 ||#
% 0.41/0.60
% 0.41/0.60 ; Summary of computation:
% 0.41/0.60 ; 382 formulas have been input or derived (from 15 formulas).
% 0.41/0.60 ; 172 (45%) were retained. Of these,
% 0.41/0.60 ; 11 ( 6%) were simplified or subsumed later,
% 0.41/0.60 ; 161 (94%) are still being kept.
% 0.41/0.60 ;
% 0.41/0.60 ; Run time in seconds excluding printing time:
% 0.41/0.60 ; 0.001 1% Read assertion file (1 call)
% 0.41/0.60 ; 0.000 0% Assert (3 calls)
% 0.41/0.60 ; 0.023 25% Process new row (347 calls)
% 0.41/0.60 ; 0.001 1% Resolution (28 calls)
% 0.41/0.60 ; 0.010 11% Paramodulation (14 calls)
% 0.41/0.60 ; 0.019 21% Forward simplification (320 calls)
% 0.41/0.60 ; 0.010 11% Backward simplification (171 calls)
% 0.41/0.60 ; 0.003 3% Ordering (790 calls)
% 0.41/0.60 ; 0.001 1% Sortal reasoning (32 calls)
% 0.41/0.60 ; 0.000 0% Purity testing (1 call)
% 0.41/0.60 ; 0.024 26% Other
% 0.41/0.60 ; 0.092 Total
% 0.41/0.60 ; 0.094 Real time
% 0.41/0.60 ;
% 0.41/0.60 ; Term-hash-array has 852 terms in all.
% 0.41/0.60 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.41/0.60 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.41/0.60 ; Path-index has 816 entries (826 at peak, 856 added, 40 deleted).
% 0.41/0.60 ; Path-index has 2,385 nodes (2,401 at peak, 2,417 added, 32 deleted).
% 0.41/0.60 ; Trie-index has 816 entries (826 at peak, 856 added, 40 deleted).
% 0.41/0.60 ; Trie-index has 4,192 nodes (4,219 at peak, 4,320 added, 128 deleted).
% 0.41/0.60 ; Retrieved 346 generalization terms in 2,885 calls.
% 0.41/0.60 ; Retrieved 520 instance terms in 185 calls.
% 0.41/0.60 ; Retrieved 1,726 unifiable terms in 129 calls.
% 0.41/0.60 ;
% 0.41/0.60 ; The agenda of rows to process has 34 entries:
% 0.41/0.60 ; 4 with value 26 1 with value 31 4 with value 35
% 0.41/0.60 ; 2 with value 27 3 with value 32 1 with value 37
% 0.41/0.60 ; 5 with value 28 5 with value 33 1 with value 38
% 0.41/0.60 ; 2 with value 29 1 with value 34 1 with value 39
% 0.41/0.60 ; 4 with value 30
% 0.41/0.60 ; The agenda of rows to give has 148 entries:
% 0.41/0.60 ; 2 with value (4 22) 14 with value (4 30) 11 with value (4 36)
% 0.41/0.60 ; 1 with value (4 23) 6 with value (4 31) 6 with value (4 37)
% 0.41/0.60 ; 2 with value (4 24) 15 with value (4 32) 8 with value (4 38)
% 0.41/0.61 ; 4 with value (4 26) 13 with value (4 33) 9 with value (4 39)
% 0.41/0.61 ; 2 with value (4 27) 8 with value (4 34) 6 with value (4 40)
% 0.41/0.61 ; 7 with value (4 28) 24 with value (4 35) 2 with value (4 42)
% 0.41/0.61 ; 8 with value (4 29)
% 0.41/0.61 Evaluation took:
% 0.41/0.61 0.094 seconds of real time
% 0.41/0.61 0.086626 seconds of user run time
% 0.41/0.61 0.007717 seconds of system run time
% 0.41/0.61 0 calls to %EVAL
% 0.41/0.61 0 page faults and
% 0.41/0.61 6,338,680 bytes consed.
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T10:42:33
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 *
%------------------------------------------------------------------------------