TSTP Solution File: GRP106-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP106-1 : TPTP v8.1.0. Bugfixed v2.7.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:36:10 EDT 2022
% Result : Unsatisfiable 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 45 ( 41 unt; 0 nHn; 6 RR)
% Number of literals : 54 ( 53 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 10 ( 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 : 118 ( 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,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/sandbox/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,
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(6,plain,
inverse(double_divide(double_divide(X,inverse(double_divide(Y,inverse(double_divide(Z,U))))),inverse(double_divide(X,Z)))) = double_divide(Y,U),
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(25,plain,
inverse(double_divide(double_divide(double_divide(X,Y),Z),U)) = double_divide(double_divide(inverse(double_divide(X,inverse(double_divide(U,Y)))),V),inverse(double_divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[8,single_axiom,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(50,plain,
double_divide(double_divide(X,Y),inverse(double_divide(inverse(double_divide(Z,inverse(double_divide(X,U)))),Y))) = double_divide(Z,U),
inference('PARAMODULATE',[status(thm)],[15,single_axiom,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(93,plain,
inverse(double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X,Y),inverse(double_divide(X,Z)))),U),Z)),U)) = Y,
inference('PARAMODULATE',[status(thm)],[17,17,theory(equality)]) ).
cnf(110,plain,
double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(double_divide(double_divide(inverse(double_divide(Y,Z)),V),V),U))),
inference('PARAMODULATE',[status(thm)],[16,44,theory(equality)]) ).
cnf(112,plain,
inverse(double_divide(double_divide(X,double_divide(double_divide(inverse(double_divide(Y,Z)),U),U)),inverse(double_divide(X,V)))) = double_divide(double_divide(V,inverse(Y)),Z),
inference('PARAMODULATE',[status(thm)],[8,44,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(129,plain,
inverse(double_divide(double_divide(double_divide(X,Y),Y),inverse(inverse(double_divide(Z,inverse(Z)))))) = X,
inference('PARAMODULATE',[status(thm)],[44,122,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(156,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Z),inverse(double_divide(double_divide(X,U),U)))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,133,theory(equality)]) ).
cnf(170,plain,
inverse(double_divide(double_divide(X,inverse(Y)),X)) = Y,
inference('PARAMODULATE',[status(thm)],[152,152,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,
( 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)],[4,171,theory(equality)]) ).
cnf(173,plain,
X = inverse(double_divide(X,inverse(inverse(double_divide(Y,inverse(Y)))))),
inference('PARAMODULATE',[status(thm)],[122,152,theory(equality)]) ).
cnf(174,plain,
double_divide(double_divide(X,Y),Y) = X,
inference('REWRITE',[status(thm)],[129,173,theory(equality)]) ).
cnf(181,plain,
inverse(double_divide(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Z),inverse(X))) = Y,
inference('REWRITE',[status(thm)],[156,174,theory(equality)]) ).
cnf(183,plain,
double_divide(X,inverse(double_divide(Y,Z))) = double_divide(inverse(double_divide(X,Y)),Z),
inference('REWRITE',[status(thm)],[151,174,theory(equality)]) ).
cnf(188,plain,
inverse(inverse(double_divide(double_divide(X,Y),X))) = Y,
inference('REWRITE',[status(thm)],[93,174,25,183,theory(equality)]) ).
cnf(191,plain,
( inverse(double_divide(inverse(double_divide(a2,b2)),inverse(b2))) != a2
| inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)) ),
inference('REWRITE',[status(thm)],[172,183,theory(equality)]) ).
cnf(205,plain,
double_divide(double_divide(X,inverse(Y)),Z) = double_divide(double_divide(X,U),inverse(double_divide(inverse(double_divide(Y,Z)),U))),
inference('REWRITE',[status(thm)],[110,174,theory(equality)]) ).
cnf(206,plain,
double_divide(double_divide(X,inverse(Y)),inverse(double_divide(X,Z))) = double_divide(Y,Z),
inference('REWRITE',[status(thm)],[50,205,theory(equality)]) ).
cnf(208,plain,
inverse(double_divide(double_divide(X,inverse(double_divide(Y,Z))),Y)) = double_divide(X,Z),
inference('REWRITE',[status(thm)],[6,206,theory(equality)]) ).
cnf(212,plain,
inverse(double_divide(double_divide(X,Y),Z)) = double_divide(double_divide(Z,inverse(X)),Y),
inference('REWRITE',[status(thm)],[112,206,174,theory(equality)]) ).
cnf(217,plain,
inverse(inverse(double_divide(double_divide(double_divide(X,Y),X),Z))) = double_divide(Z,Y),
inference('REWRITE',[status(thm)],[208,212,theory(equality)]) ).
cnf(219,plain,
inverse(double_divide(inverse(double_divide(X,Y)),inverse(Y))) = X,
inference('REWRITE',[status(thm)],[181,174,212,theory(equality)]) ).
cnf(220,plain,
inverse(double_divide(b4,a4)) != inverse(double_divide(a4,b4)),
inference('REWRITE',[status(thm)],[191,219,theory(equality)]) ).
cnf(225,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[170,174,212,theory(equality)]) ).
cnf(237,plain,
double_divide(double_divide(double_divide(X,Y),X),Z) = double_divide(Z,Y),
inference('REWRITE',[status(thm)],[217,225,theory(equality)]) ).
cnf(254,plain,
double_divide(double_divide(X,Y),X) = Y,
inference('REWRITE',[status(thm)],[188,225,theory(equality)]) ).
cnf(255,plain,
double_divide(X,Y) = double_divide(Y,X),
inference('REWRITE',[status(thm)],[237,254,theory(equality)]) ).
cnf(277,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[220,255,theory(equality)]),theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP106-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue Jun 14 07:22:18 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48 *
% 0.21/0.48 *
% 0.21/0.49 #<PACKAGE "SNARK-USER">
% 0.21/0.49 *
% 0.21/0.49 SNARK-TPTP-OPTIONS
% 0.21/0.49 *
% 0.21/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49 (USE-FACTORING :POS)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49 *
% 0.21/0.49 "."
% 0.21/0.49 *
% 0.21/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T07:22:18
% 0.21/0.49 ; 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-14T07:22:18
% 0.48/0.64
% 0.48/0.64
% 0.48/0.64 #||
% 0.48/0.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64 % SZS output start Refutation
% See solution above
% 0.48/0.66 ||#
% 0.48/0.66
% 0.48/0.66 ; Summary of computation:
% 0.48/0.66 ; 582 formulas have been input or derived (from 17 formulas).
% 0.48/0.66 ; 277 (48%) were retained. Of these,
% 0.48/0.66 ; 175 (63%) were simplified or subsumed later,
% 0.48/0.66 ; 102 (37%) are still being kept.
% 0.48/0.66 ;
% 0.48/0.66 ; Run time in seconds excluding printing time:
% 0.48/0.66 ; 0.001 1% Read assertion file (1 call)
% 0.48/0.66 ; 0.001 1% Assert (3 calls)
% 0.48/0.66 ; 0.034 22% Process new row (550 calls)
% 0.48/0.66 ; 0.001 1% Resolution (32 calls)
% 0.48/0.66 ; 0.016 10% Paramodulation (16 calls)
% 0.48/0.66 ; 0.000 0% Condensing (3 calls)
% 0.48/0.66 ; 0.001 1% Forward subsumption (3 calls)
% 0.48/0.66 ; 0.000 0% Backward subsumption (3 calls)
% 0.48/0.66 ; 0.033 22% Forward simplification (491 calls)
% 0.48/0.66 ; 0.023 15% Backward simplification (276 calls)
% 0.48/0.66 ; 0.018 12% Ordering (2,044 calls)
% 0.48/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.66 ; 0.000 0% Purity testing (1 call)
% 0.48/0.66 ; 0.025 16% Other
% 0.48/0.66 ; 0.153 Total
% 0.48/0.66 ; 0.165 Real time
% 0.48/0.66 ;
% 0.48/0.66 ; Term-hash-array has 1,174 terms in all.
% 0.48/0.66 ; Feature-vector-row-index has 0 entries (1 at peak, 3 added, 3 deleted).
% 0.48/0.66 ; Feature-vector-row-index has 1 node (36 at peak, 85 added, 84 deleted).
% 0.48/0.66 ; Retrieved 0 possibly forward subsuming rows in 3 calls.
% 0.48/0.66 ; Retrieved 0 possibly backward subsumed rows in 3 calls.
% 0.48/0.66 ; Path-index has 481 entries (853 at peak, 1,297 added, 816 deleted).
% 0.48/0.66 ; Path-index has 2,108 nodes (2,457 at peak, 2,797 added, 689 deleted).
% 0.48/0.66 ; Trie-index has 481 entries (853 at peak, 1,297 added, 816 deleted).
% 0.48/0.66 ; Trie-index has 2,108 nodes (4,300 at peak, 5,743 added, 3,635 deleted).
% 0.48/0.66 ; Retrieved 1,358 generalization terms in 4,432 calls.
% 0.48/0.66 ; Retrieved 2,123 instance terms in 317 calls.
% 0.48/0.66 ; Retrieved 2,360 unifiable terms in 167 calls.
% 0.48/0.66 ;
% 0.48/0.66 ; The agenda of rows to process has 31 entries:
% 0.48/0.66 ; 3 with value 14 12 with value 25 12 with value 26
% 0.48/0.66 ; 4 with value 22
% 0.48/0.66 ; The agenda of rows to give has 95 entries:
% 0.48/0.66 ; 1 with value (4 14) 4 with value (4 26) 3 with value (4 33)
% 0.48/0.66 ; 2 with value (4 16) 6 with value (4 27) 3 with value (4 34)
% 0.48/0.66 ; 1 with value (4 20) 5 with value (4 28) 6 with value (4 35)
% 0.48/0.66 ; 1 with value (4 21) 4 with value (4 29) 6 with value (4 36)
% 0.48/0.66 ; 10 with value (4 22) 7 with value (4 30) 1 with value (4 37)
% 0.48/0.66 ; 1 with value (4 23) 8 with value (4 31) 4 with value (4 38)
% 0.48/0.66 ; 7 with value (4 24) 7 with value (4 32) 3 with value (4 39)
% 0.48/0.66 ; 5 with value (4 25)
% 0.48/0.66 Evaluation took:
% 0.48/0.66 0.166 seconds of real time
% 0.48/0.66 0.149884 seconds of user run time
% 0.48/0.66 0.015825 seconds of system run time
% 0.48/0.66 [Run times include 0.007 seconds GC run time.]
% 0.48/0.66 0 calls to %EVAL
% 0.48/0.66 0 page faults and
% 0.48/0.66 13,210,912 bytes consed.
% 0.48/0.66 :PROOF-FOUND
% 0.48/0.66 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T07:22:18
% 0.48/0.66 :PROOF-FOUND
% 0.48/0.66 *
%------------------------------------------------------------------------------