TSTP Solution File: BOO074-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : BOO074-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 : Thu Jul 14 23:49:08 EDT 2022
% Result : Unsatisfiable 0.52s 0.69s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 2
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 2 RR)
% Number of literals : 42 ( 41 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 81 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dn1,axiom,
inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,inverse(add(inverse(Z),inverse(add(Z,U)))))))) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dn1) ).
cnf(huntinton_3,negated_conjecture,
add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',huntinton_3) ).
cnf(3,plain,
inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(inverse(add(Z,U)),X)),inverse(add(inverse(Y),inverse(add(Y,V)))))))) = Y,
inference('PARAMODULATE',[status(thm)],[dn1,dn1,theory(equality)]) ).
cnf(8,plain,
inverse(add(inverse(add(X,inverse(X))),X)) = inverse(X),
inference('PARAMODULATE',[status(thm)],[3,dn1,theory(equality)]) ).
cnf(10,plain,
inverse(add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y)))))))) = X,
inference('PARAMODULATE',[status(thm)],[dn1,8,theory(equality)]) ).
cnf(16,plain,
inverse(add(inverse(X),inverse(add(X,X)))) = X,
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(17,plain,
inverse(add(inverse(add(inverse(add(X,Y)),Z)),inverse(add(X,Z)))) = Z,
inference('PARAMODULATE',[status(thm)],[dn1,10,theory(equality)]) ).
cnf(30,plain,
inverse(add(X,inverse(add(add(inverse(X),inverse(add(X,X))),add(inverse(X),inverse(add(X,X))))))) = add(inverse(X),inverse(add(X,X))),
inference('PARAMODULATE',[status(thm)],[16,16,theory(equality)]) ).
cnf(35,plain,
inverse(add(X,inverse(add(add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y))))))),add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y))))))))))) = add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y))))))),
inference('PARAMODULATE',[status(thm)],[16,10,theory(equality)]) ).
cnf(37,plain,
inverse(add(inverse(add(X,Y)),inverse(add(inverse(X),Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[17,16,theory(equality)]) ).
cnf(51,plain,
inverse(add(X,inverse(add(add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,X))),add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,X))))))) = add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,X))),
inference('PARAMODULATE',[status(thm)],[16,17,theory(equality)]) ).
cnf(55,plain,
inverse(add(inverse(add(add(X,inverse(X)),X)),inverse(X))) = X,
inference('PARAMODULATE',[status(thm)],[37,8,theory(equality)]) ).
cnf(56,plain,
inverse(add(inverse(add(X,Y)),inverse(add(inverse(add(Z,X)),Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[17,37,theory(equality)]) ).
cnf(79,plain,
inverse(add(X,inverse(add(add(inverse(add(Y,X)),inverse(add(inverse(Y),X))),add(inverse(add(Y,X)),inverse(add(inverse(Y),X))))))) = add(inverse(add(Y,X)),inverse(add(inverse(Y),X))),
inference('PARAMODULATE',[status(thm)],[16,37,theory(equality)]) ).
cnf(102,plain,
inverse(add(inverse(add(inverse(X),X)),inverse(X))) = X,
inference('PARAMODULATE',[status(thm)],[56,8,theory(equality)]) ).
cnf(103,plain,
inverse(add(inverse(add(inverse(X),Y)),inverse(add(X,Y)))) = Y,
inference('PARAMODULATE',[status(thm)],[56,55,theory(equality)]) ).
cnf(125,plain,
inverse(add(X,inverse(add(add(inverse(add(Y,X)),inverse(add(inverse(add(Z,Y)),X))),add(inverse(add(Y,X)),inverse(add(inverse(add(Z,Y)),X))))))) = add(inverse(add(Y,X)),inverse(add(inverse(add(Z,Y)),X))),
inference('PARAMODULATE',[status(thm)],[16,56,theory(equality)]) ).
cnf(130,plain,
inverse(add(X,inverse(add(inverse(X),inverse(X))))) = inverse(X),
inference('PARAMODULATE',[status(thm)],[17,102,theory(equality)]) ).
cnf(190,plain,
inverse(add(X,inverse(add(add(inverse(add(inverse(Y),X)),inverse(add(Y,X))),add(inverse(add(inverse(Y),X)),inverse(add(Y,X))))))) = add(inverse(add(inverse(Y),X)),inverse(add(Y,X))),
inference('PARAMODULATE',[status(thm)],[16,103,theory(equality)]) ).
cnf(197,plain,
inverse(add(inverse(X),inverse(X))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,130,theory(equality)]),130,theory(equality)]) ).
cnf(198,plain,
inverse(add(X,X)) = inverse(X),
inference('REWRITE',[status(thm)],[130,197,theory(equality)]) ).
cnf(199,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[197,198,theory(equality)]) ).
cnf(213,plain,
inverse(X) = add(inverse(X),inverse(add(X,inverse(add(inverse(X),inverse(add(X,Y))))))),
inference('REWRITE',[status(thm)],[35,10,198,theory(equality)]) ).
cnf(214,plain,
inverse(X) = add(inverse(add(inverse(Y),X)),inverse(add(Y,X))),
inference('REWRITE',[status(thm)],[190,103,198,theory(equality)]) ).
cnf(215,plain,
inverse(X) = add(inverse(add(Y,X)),inverse(add(inverse(add(Z,Y)),X))),
inference('REWRITE',[status(thm)],[125,56,198,theory(equality)]) ).
cnf(216,plain,
inverse(X) = add(inverse(add(Y,X)),inverse(add(inverse(Y),X))),
inference('REWRITE',[status(thm)],[79,37,198,theory(equality)]) ).
cnf(217,plain,
inverse(X) = add(inverse(add(inverse(add(Y,Z)),X)),inverse(add(Y,X))),
inference('REWRITE',[status(thm)],[51,17,198,theory(equality)]) ).
cnf(228,plain,
inverse(X) = add(inverse(X),inverse(X)),
inference('REWRITE',[status(thm)],[30,199,198,theory(equality)]) ).
cnf(232,plain,
X = add(X,X),
inference('PARAMODULATE',[status(thm)],[228,199,theory(equality)]) ).
cnf(247,plain,
add(X,Y) = add(Y,inverse(add(inverse(add(X,Z)),inverse(add(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[217,217,theory(equality)]),199,theory(equality)]) ).
cnf(249,plain,
add(inverse(X),Y) = add(Y,inverse(add(X,inverse(add(inverse(X),Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[217,216,theory(equality)]),199,theory(equality)]) ).
cnf(250,plain,
add(X,Y) = add(Y,inverse(add(inverse(X),inverse(add(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[217,214,theory(equality)]),199,theory(equality)]) ).
cnf(284,plain,
add(X,Y) = add(inverse(add(Y,inverse(add(X,Y)))),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[215,217,theory(equality)]),199,theory(equality)]) ).
cnf(306,plain,
inverse(X) = add(inverse(add(Y,X)),inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[217,284,theory(equality)]),232,theory(equality)]) ).
cnf(311,plain,
X = add(inverse(add(Y,inverse(X))),X),
inference('PARAMODULATE',[status(thm)],[306,199,theory(equality)]) ).
cnf(318,plain,
inverse(X) = add(inverse(X),inverse(add(Y,X))),
inference('PARAMODULATE',[status(thm)],[217,311,theory(equality)]) ).
cnf(332,plain,
add(X,add(X,Y)) = add(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[247,318,theory(equality)]),232,199,theory(equality)]) ).
cnf(355,plain,
add(X,inverse(add(inverse(X),inverse(add(X,Y))))) = inverse(add(inverse(X),inverse(add(X,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[247,249,theory(equality)]),232,theory(equality)]) ).
cnf(361,plain,
inverse(X) = add(inverse(X),inverse(add(X,Y))),
inference('REWRITE',[status(thm)],[213,332,199,355,theory(equality)]) ).
cnf(362,plain,
add(X,Y) = add(Y,X),
inference('REWRITE',[status(thm)],[250,199,361,theory(equality)]) ).
cnf(389,plain,
inverse(X) = add(inverse(add(Y,X)),inverse(add(X,inverse(Y)))),
inference('PARAMODULATE',[status(thm)],[216,362,theory(equality)]) ).
cnf(391,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[huntinton_3,362,theory(equality)]),199,389,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO074-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 1 22:13:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.48 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T22:13:16
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-01T22:13:16
% 0.52/0.69
% 0.52/0.69
% 0.52/0.69 #||
% 0.52/0.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.69 % SZS output start Refutation
% See solution above
% 0.52/0.70 ||#
% 0.52/0.70
% 0.52/0.70 ; Summary of computation:
% 0.52/0.70 ; 1163 formulas have been input or derived (from 42 formulas).
% 0.52/0.70 ; 391 (34%) were retained. Of these,
% 0.52/0.70 ; 306 (78%) were simplified or subsumed later,
% 0.52/0.70 ; 85 (22%) are still being kept.
% 0.52/0.70 ;
% 0.52/0.70 ; Run time in seconds excluding printing time:
% 0.52/0.70 ; 0.001 0% Read assertion file (1 call)
% 0.52/0.70 ; 0.000 0% Assert (2 calls)
% 0.52/0.70 ; 0.063 30% Process new row (1,074 calls)
% 0.52/0.70 ; 0.004 2% Resolution (82 calls)
% 0.52/0.70 ; 0.028 13% Paramodulation (41 calls)
% 0.52/0.70 ; 0.039 19% Forward simplification (1,022 calls)
% 0.52/0.70 ; 0.035 17% Backward simplification (391 calls)
% 0.52/0.70 ; 0.011 5% Ordering (1,940 calls)
% 0.52/0.70 ; 0.001 0% Sortal reasoning (32 calls)
% 0.52/0.70 ; 0.000 0% Purity testing (1 call)
% 0.52/0.70 ; 0.027 13% Other
% 0.52/0.70 ; 0.209 Total
% 0.52/0.70 ; 0.214 Real time
% 0.52/0.70 ;
% 0.52/0.70 ; Term-hash-array has 1,991 terms in all.
% 0.52/0.70 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.52/0.70 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.52/0.70 ; Path-index has 376 entries (1,252 at peak, 2,036 added, 1,660 deleted).
% 0.52/0.70 ; Path-index has 2,557 nodes (3,227 at peak, 3,923 added, 1,366 deleted).
% 0.52/0.70 ; Trie-index has 376 entries (1,252 at peak, 2,036 added, 1,660 deleted).
% 0.52/0.70 ; Trie-index has 1,650 nodes (10,051 at peak, 14,127 added, 12,477 deleted).
% 0.52/0.70 ; Retrieved 5,507 generalization terms in 8,812 calls.
% 0.52/0.70 ; Retrieved 3,514 instance terms in 390 calls.
% 0.52/0.70 ; Retrieved 7,411 unifiable terms in 344 calls.
% 0.52/0.70 ;
% 0.52/0.70 ; The agenda of rows to process has 40 entries:
% 0.52/0.70 ; 11 with value 29 15 with value 31 14 with value 32
% 0.52/0.70 ; The agenda of rows to give has 67 entries:
% 0.52/0.70 ; 1 with value (4 19) 1 with value (4 32) 1 with value (4 42)
% 0.52/0.70 ; 1 with value (4 20) 4 with value (4 34) 1 with value (4 44)
% 0.52/0.70 ; 2 with value (4 24) 1 with value (4 35) 2 with value (4 46)
% 0.52/0.70 ; 2 with value (4 25) 5 with value (4 36) 2 with value (4 47)
% 0.52/0.70 ; 4 with value (4 28) 8 with value (4 37) 1 with value (4 48)
% 0.52/0.70 ; 3 with value (4 29) 7 with value (4 38) 1 with value (4 49)
% 0.52/0.70 ; 7 with value (4 30) 3 with value (4 40) 1 with value (4 54)
% 0.52/0.70 ; 4 with value (4 31) 4 with value (4 41) 1 with value (4 55)
% 0.52/0.70 Evaluation took:
% 0.52/0.70 0.215 seconds of real time
% 0.52/0.70 0.196504 seconds of user run time
% 0.52/0.70 0.018067 seconds of system run time
% 0.52/0.70 [Run times include 0.008 seconds GC run time.]
% 0.52/0.70 0 calls to %EVAL
% 0.52/0.70 0 page faults and
% 0.52/0.70 19,444,104 bytes consed.
% 0.52/0.70 :PROOF-FOUND
% 0.52/0.70 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T22:13:16
% 0.52/0.70 :PROOF-FOUND
% 0.52/0.70 *
%------------------------------------------------------------------------------