TSTP Solution File: BOO034-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.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 : Thu Jul 14 23:49:03 EDT 2022
% Result : Unsatisfiable 0.79s 0.99s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 5 RR)
% Number of literals : 30 ( 29 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 79 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(X,Y,multiply(Z,U,V)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',associativity) ).
cnf(ternary_multiply_1,axiom,
multiply(X,Y,Y) = Y,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_1) ).
cnf(ternary_multiply_2,axiom,
multiply(X,X,Y) = X,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_2) ).
cnf(right_inverse,axiom,
multiply(X,Y,inverse(Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',right_inverse) ).
cnf(prove_single_axiom,negated_conjecture,
multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_single_axiom) ).
cnf(7,plain,
multiply(X,Y,X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[ternary_multiply_2,associativity,theory(equality)]),ternary_multiply_2,theory(equality)]) ).
cnf(8,plain,
multiply(X,Y,multiply(Z,X,U)) = multiply(Z,X,multiply(X,Y,U)),
inference('PARAMODULATE',[status(thm)],[associativity,ternary_multiply_1,theory(equality)]) ).
cnf(9,plain,
multiply(multiply(X,Y,Z),U,Y) = multiply(X,Y,multiply(Z,U,Y)),
inference('PARAMODULATE',[status(thm)],[associativity,ternary_multiply_1,theory(equality)]) ).
cnf(24,plain,
multiply(X,Y,Z) = multiply(Z,X,multiply(X,Y,Z)),
inference('PARAMODULATE',[status(thm)],[8,7,theory(equality)]) ).
cnf(25,plain,
multiply(X,Y,multiply(Z,X,Y)) = multiply(Z,X,Y),
inference('PARAMODULATE',[status(thm)],[8,ternary_multiply_1,theory(equality)]) ).
cnf(26,plain,
multiply(X,Y,Z) = multiply(Z,X,multiply(X,Y,inverse(X))),
inference('PARAMODULATE',[status(thm)],[8,right_inverse,theory(equality)]) ).
cnf(50,plain,
multiply(X,inverse(X),Y) = Y,
inference('PARAMODULATE',[status(thm)],[25,right_inverse,theory(equality)]) ).
cnf(51,plain,
multiply(b,inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
inference('REWRITE',[status(thm)],[prove_single_axiom,50,theory(equality)]) ).
cnf(52,plain,
multiply(multiply(X,Y,Z),X,Y) = multiply(Z,X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,25,theory(equality)]),ternary_multiply_1,theory(equality)]) ).
cnf(61,plain,
inverse(inverse(X)) = X,
inference('PARAMODULATE',[status(thm)],[right_inverse,50,theory(equality)]) ).
cnf(63,plain,
multiply(X,inverse(Y),Y) = X,
inference('PARAMODULATE',[status(thm)],[right_inverse,61,theory(equality)]) ).
cnf(69,plain,
X = multiply(inverse(Y),X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,right_inverse,theory(equality)]),ternary_multiply_2,theory(equality)]) ).
cnf(71,plain,
X = multiply(Y,X,inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,63,theory(equality)]),ternary_multiply_2,theory(equality)]) ).
cnf(72,plain,
multiply(X,Y,Z) = multiply(Z,X,Y),
inference('REWRITE',[status(thm)],[26,71,theory(equality)]) ).
cnf(84,plain,
multiply(X,Y,Z) = multiply(X,Y,multiply(X,Y,Z)),
inference('PARAMODULATE',[status(thm)],[24,72,theory(equality)]) ).
cnf(101,plain,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(X,Y,multiply(V,Z,U)),
inference('PARAMODULATE',[status(thm)],[associativity,72,theory(equality)]) ).
cnf(108,plain,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(X,Y,multiply(U,V,Z)),
inference('PARAMODULATE',[status(thm)],[associativity,72,theory(equality)]) ).
cnf(112,plain,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(Y,multiply(Z,U,V),X),
inference('PARAMODULATE',[status(thm)],[associativity,72,theory(equality)]) ).
cnf(113,plain,
multiply(b,inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(multiply(c,d,g),f,multiply(c,d,e))) != b,
inference('REWRITE',[status(thm)],[51,112,theory(equality)]) ).
cnf(136,plain,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(multiply(X,Y,V),multiply(X,Y,Z),multiply(X,Y,U)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,84,theory(equality)]),108,theory(equality)]) ).
cnf(138,plain,
multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(multiply(X,Y,V),Z,multiply(X,Y,U)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,84,theory(equality)]),136,101,theory(equality)]) ).
cnf(140,plain,
multiply(b,inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(multiply(c,d,e),g,multiply(c,d,f))) != b,
inference('REWRITE',[status(thm)],[113,138,theory(equality)]) ).
cnf(202,plain,
multiply(X,Y,Z) = multiply(X,Z,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,right_inverse,theory(equality)]),69,theory(equality)]) ).
cnf(275,plain,
multiply(X,Y,Z) = multiply(Z,Y,X),
inference('PARAMODULATE',[status(thm)],[72,202,theory(equality)]) ).
cnf(346,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[140,275,theory(equality)]),63,138,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO034-1 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 18:50:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49 *
% 0.20/0.49 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T18:50:21
% 0.20/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-01T18:50:21
% 0.79/0.99
% 0.79/0.99
% 0.79/0.99 #||
% 0.79/0.99 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.79/0.99 % SZS output start Refutation
% See solution above
% 0.79/0.99 ||#
% 0.79/0.99
% 0.79/0.99 ; Summary of computation:
% 0.79/0.99 ; 1050 formulas have been input or derived (from 31 formulas).
% 0.79/0.99 ; 346 (33%) were retained. Of these,
% 0.79/0.99 ; 40 (12%) were simplified or subsumed later,
% 0.79/0.99 ; 306 (88%) are still being kept.
% 0.79/0.99 ;
% 0.79/0.99 ; Run time in seconds excluding printing time:
% 0.79/0.99 ; 0.002 0% Read assertion file (1 call)
% 0.79/0.99 ; 0.000 0% Assert (6 calls)
% 0.79/0.99 ; 0.030 6% Process new row (1,016 calls)
% 0.79/0.99 ; 0.002 0% Resolution (60 calls)
% 0.79/0.99 ; 0.025 5% Paramodulation (30 calls)
% 0.79/0.99 ; 0.094 19% Forward simplification (1,004 calls)
% 0.79/0.99 ; 0.098 20% Backward simplification (346 calls)
% 0.79/0.99 ; 0.219 44% Ordering (20,516 calls)
% 0.79/0.99 ; 0.000 0% Sortal reasoning (32 calls)
% 0.79/0.99 ; 0.000 0% Purity testing (1 call)
% 0.79/0.99 ; 0.029 6% Other
% 0.79/0.99 ; 0.499 Total
% 0.79/0.99 ; 0.502 Real time
% 0.79/0.99 ;
% 0.79/0.99 ; Term-hash-array has 997 terms in all.
% 0.79/0.99 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.79/0.99 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.79/0.99 ; Path-index has 908 entries (908 at peak, 1,041 added, 133 deleted).
% 0.79/0.99 ; Path-index has 611 nodes (611 at peak, 821 added, 210 deleted).
% 0.79/0.99 ; Trie-index has 908 entries (908 at peak, 1,041 added, 133 deleted).
% 0.79/0.99 ; Trie-index has 2,687 nodes (2,687 at peak, 3,168 added, 481 deleted).
% 0.79/0.99 ; Retrieved 49,909 generalization terms in 4,886 calls.
% 0.79/0.99 ; Retrieved 40,124 instance terms in 617 calls.
% 0.79/0.99 ; Retrieved 7,678 unifiable terms in 201 calls.
% 0.79/0.99 ;
% 0.79/0.99 ; The agenda of rows to process has 8 entries:
% 0.79/0.99 ; 8 with value 34
% 0.79/0.99 ; The agenda of rows to give has 278 entries:
% 0.79/0.99 ; 3 with value (4 17) 31 with value (4 25) 18 with value (4 32)
% 0.79/0.99 ; 5 with value (4 18) 13 with value (4 26) 29 with value (4 33)
% 0.79/0.99 ; 16 with value (4 19) 21 with value (4 27) 12 with value (4 34)
% 0.79/0.99 ; 5 with value (4 20) 10 with value (4 28) 6 with value (4 35)
% 0.79/0.99 ; 28 with value (4 21) 13 with value (4 29) 3 with value (4 36)
% 0.79/0.99 ; 18 with value (4 22) 17 with value (4 30) 2 with value (4 38)
% 0.79/0.99 ; 4 with value (4 23) 4 with value (4 31) 1 with value (4 39)
% 0.79/0.99 ; 19 with value (4 24)
% 0.79/0.99 Evaluation took:
% 0.79/0.99 0.502 seconds of real time
% 0.79/0.99 0.455711 seconds of user run time
% 0.79/0.99 0.046001 seconds of system run time
% 0.79/0.99 [Run times include 0.012 seconds GC run time.]
% 0.79/0.99 0 calls to %EVAL
% 0.79/0.99 0 page faults and
% 0.79/0.99 32,208,472 bytes consed.
% 0.79/0.99 :PROOF-FOUND
% 0.79/0.99 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-01T18:50:21
% 0.79/1.00 :PROOF-FOUND
% 0.79/1.00 *
%------------------------------------------------------------------------------