TSTP Solution File: GRP519-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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:15 EDT 2022
% Result : Unsatisfiable 0.15s 0.43s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 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; 3 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,multiply(multiply(inverse(multiply(X,Y)),Z),Y)) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(3,plain,
multiply(X,multiply(multiply(inverse(Y),Z),multiply(multiply(inverse(multiply(X,U)),Y),U))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(4,plain,
multiply(X,multiply(Y,Z)) = multiply(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y),U),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(multiply(inverse(X),Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(6,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(multiply(inverse(U),V)),Y),V),
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(9,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(multiply(inverse(multiply(inverse(U),W)),V),W)),
inference('PARAMODULATE',[status(thm)],[3,3,theory(equality)]) ).
cnf(13,plain,
multiply(X,Y) = multiply(multiply(inverse(multiply(inverse(Y),Z)),X),Z),
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(14,plain,
multiply(X,multiply(Y,Z)) = multiply(Y,multiply(X,Z)),
inference('REWRITE',[status(thm)],[4,13,theory(equality)]) ).
cnf(16,plain,
multiply(multiply(a3,b3),c3) != multiply(b3,multiply(a3,c3)),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,14,theory(equality)]) ).
cnf(17,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(multiply(inverse(V),Y),multiply(V,U)),
inference('REWRITE',[status(thm)],[9,13,theory(equality)]) ).
cnf(18,plain,
multiply(X,multiply(Y,multiply(multiply(inverse(multiply(X,Z)),U),Z))) = multiply(Y,U),
inference('REWRITE',[status(thm)],[6,13,theory(equality)]) ).
cnf(19,plain,
multiply(X,Y) = multiply(multiply(inverse(Z),X),multiply(Z,Y)),
inference('REWRITE',[status(thm)],[17,18,theory(equality)]) ).
cnf(20,plain,
multiply(X,Y) = multiply(multiply(inverse(Z),Y),multiply(X,Z)),
inference('PARAMODULATE',[status(thm)],[14,5,theory(equality)]) ).
cnf(27,plain,
multiply(X,Y) = multiply(Y,X),
inference('PARAMODULATE',[status(thm)],[19,20,theory(equality)]) ).
cnf(39,plain,
multiply(multiply(b3,a3),c3) != multiply(b3,multiply(a3,c3)),
inference('PARAMODULATE',[status(thm)],[16,27,theory(equality)]) ).
cnf(40,plain,
multiply(X,multiply(Y,Z)) = multiply(Z,multiply(X,Y)),
inference('PARAMODULATE',[status(thm)],[14,27,theory(equality)]) ).
cnf(45,plain,
$false,
inference('REWRITE',[status(thm)],[39,27,40,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% 0.09/0.11 % Command : run-snark %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Mon Jun 13 05:48:41 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.15/0.39 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.40 *
% 0.15/0.40 *
% 0.15/0.40 #<PACKAGE "SNARK-USER">
% 0.15/0.40 *
% 0.15/0.40 SNARK-TPTP-OPTIONS
% 0.15/0.40 *
% 0.15/0.40 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40 (USE-FACTORING :POS)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40 *
% 0.15/0.40 "."
% 0.15/0.40 *
% 0.15/0.40 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:48:41
% 0.15/0.40 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-13T05:48:41
% 0.15/0.43
% 0.15/0.43
% 0.15/0.43 #||
% 0.15/0.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.43 % SZS output start Refutation
% See solution above
% 0.15/0.43 ||#
% 0.15/0.43
% 0.15/0.43 ; Summary of computation:
% 0.15/0.43 ; 114 formulas have been input or derived (from 10 formulas).
% 0.15/0.43 ; 45 (39%) were retained. Of these,
% 0.15/0.43 ; 17 (38%) were simplified or subsumed later,
% 0.15/0.43 ; 28 (62%) are still being kept.
% 0.15/0.43 ;
% 0.15/0.43 ; Run time in seconds excluding printing time:
% 0.15/0.43 ; 0.000 0% Read assertion file (1 call)
% 0.15/0.43 ; 0.001 4% Assert (2 calls)
% 0.15/0.43 ; 0.004 15% Process new row (90 calls)
% 0.15/0.43 ; 0.000 0% Resolution (18 calls)
% 0.15/0.43 ; 0.003 11% Paramodulation (9 calls)
% 0.15/0.43 ; 0.001 4% Forward simplification (88 calls)
% 0.15/0.43 ; 0.002 7% Backward simplification (45 calls)
% 0.15/0.43 ; 0.003 11% Ordering (396 calls)
% 0.15/0.43 ; 0.000 0% Sortal reasoning (32 calls)
% 0.15/0.43 ; 0.000 0% Purity testing (1 call)
% 0.15/0.43 ; 0.013 48% Other
% 0.15/0.43 ; 0.027 Total
% 0.15/0.43 ; 0.030 Real time
% 0.15/0.43 ;
% 0.15/0.43 ; Term-hash-array has 201 terms in all.
% 0.15/0.43 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.15/0.43 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.15/0.43 ; Path-index has 126 entries (134 at peak, 226 added, 100 deleted).
% 0.15/0.43 ; Path-index has 357 nodes (357 at peak, 474 added, 117 deleted).
% 0.15/0.43 ; Trie-index has 126 entries (134 at peak, 226 added, 100 deleted).
% 0.15/0.43 ; Trie-index has 369 nodes (387 at peak, 738 added, 369 deleted).
% 0.15/0.43 ; Retrieved 284 generalization terms in 458 calls.
% 0.15/0.43 ; Retrieved 260 instance terms in 54 calls.
% 0.15/0.43 ; Retrieved 453 unifiable terms in 71 calls.
% 0.15/0.43 ;
% 0.15/0.43 ; The agenda of rows to process has 24 entries:
% 0.15/0.43 ; 12 with value 19 12 with value 21
% 0.15/0.43 ; The agenda of rows to give has 22 entries:
% 0.15/0.43 ; 1 with value (4 16) 1 with value (4 22) 3 with value (4 26)
% 0.15/0.43 ; 1 with value (4 17) 1 with value (4 23) 1 with value (4 27)
% 0.15/0.43 ; 3 with value (4 19) 4 with value (4 24) 1 with value (4 31)
% 0.15/0.43 ; 1 with value (4 20) 2 with value (4 25) 1 with value (4 37)
% 0.15/0.43 ; 2 with value (4 21)
% 0.15/0.43 Evaluation took:
% 0.15/0.43 0.03 seconds of real time
% 0.15/0.43 0.022096 seconds of user run time
% 0.15/0.43 0.007804 seconds of system run time
% 0.15/0.43 0 calls to %EVAL
% 0.15/0.43 0 page faults and
% 0.15/0.43 3,733,912 bytes consed.
% 0.15/0.43 :PROOF-FOUND
% 0.15/0.43 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T05:48:41
% 0.15/0.43 :PROOF-FOUND
% 0.15/0.43 *
%------------------------------------------------------------------------------