TSTP Solution File: GRP515-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP515-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:14 EDT 2022
% Result : Unsatisfiable 0.55s 0.72s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 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 : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X,multiply(multiply(Y,Z),inverse(multiply(X,Z)))) = Y,
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(Y,multiply(multiply(Z,U),inverse(multiply(X,U)))),inverse(Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(5,plain,
multiply(X,multiply(Y,inverse(Y))) = X,
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(11,plain,
multiply(X,multiply(Y,inverse(X))) = Y,
inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]) ).
cnf(12,plain,
multiply(X,multiply(multiply(Y,multiply(Z,inverse(X))),inverse(Z))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,5,theory(equality)]),5,theory(equality)]) ).
cnf(13,plain,
multiply(X,multiply(multiply(Y,Z),inverse(Y))) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[3,11,theory(equality)]) ).
cnf(17,plain,
multiply(X,multiply(Y,inverse(Z))) = multiply(X,multiply(multiply(Y,U),inverse(multiply(Z,U)))),
inference('PARAMODULATE',[status(thm)],[13,single_axiom,theory(equality)]) ).
cnf(21,plain,
multiply(X,multiply(Y,inverse(multiply(Y,multiply(X,inverse(Z)))))) = Z,
inference('PARAMODULATE',[status(thm)],[12,12,theory(equality)]) ).
cnf(24,plain,
multiply(multiply(X,Y),multiply(Z,inverse(multiply(Z,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[21,13,theory(equality)]) ).
cnf(28,plain,
multiply(multiply(X,multiply(Y,inverse(multiply(Y,Z)))),Z) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,24,theory(equality)]),13,theory(equality)]) ).
cnf(29,plain,
multiply(X,Y) = multiply(X,multiply(Z,inverse(multiply(Z,inverse(Y))))),
inference('PARAMODULATE',[status(thm)],[13,28,theory(equality)]) ).
cnf(30,plain,
multiply(X,Y) = multiply(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,28,theory(equality)]),29,theory(equality)]) ).
cnf(34,plain,
multiply(X,multiply(inverse(X),Y)) = Y,
inference('PARAMODULATE',[status(thm)],[11,30,theory(equality)]) ).
cnf(39,plain,
multiply(multiply(b3,a3),c3) != multiply(a3,multiply(b3,c3)),
inference('PARAMODULATE',[status(thm)],[prove_these_axioms_3,30,theory(equality)]) ).
cnf(70,plain,
X = multiply(multiply(Y,X),inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,13,theory(equality)]),34,theory(equality)]) ).
cnf(99,plain,
multiply(multiply(b3,a3),c3) != multiply(multiply(b3,c3),a3),
inference('PARAMODULATE',[status(thm)],[39,30,theory(equality)]) ).
cnf(372,plain,
multiply(multiply(X,Y),multiply(Z,inverse(X))) = multiply(Z,Y),
inference('PARAMODULATE',[status(thm)],[11,17,theory(equality)]) ).
cnf(384,plain,
multiply(multiply(X,Y),Z) = multiply(multiply(X,Z),Y),
inference('PARAMODULATE',[status(thm)],[372,70,theory(equality)]) ).
cnf(385,plain,
$false,
inference('REWRITE',[status(thm)],[99,384,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.10 % Command : run-snark %s %d
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 13 22:03:27 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.37 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 *
% 0.14/0.38 *
% 0.14/0.38 #<PACKAGE "SNARK-USER">
% 0.14/0.38 *
% 0.14/0.38 SNARK-TPTP-OPTIONS
% 0.14/0.38 *
% 0.14/0.38 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.38 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.38 (USE-FACTORING :POS)
% 0.14/0.38 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.38 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.38 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.38 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.38 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.38 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.38 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.38 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.38 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.38 (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.38 *
% 0.14/0.38 "."
% 0.14/0.38 *
% 0.14/0.38 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:03:27
% 0.14/0.38 ; 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-13T22:03:27
% 0.55/0.72
% 0.55/0.72
% 0.55/0.72 #||
% 0.55/0.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.72 % SZS output start Refutation
% See solution above
% 0.55/0.73 ||#
% 0.55/0.73
% 0.55/0.73 ; Summary of computation:
% 0.55/0.73 ; 3033 formulas have been input or derived (from 63 formulas).
% 0.55/0.73 ; 385 (13%) were retained. Of these,
% 0.55/0.73 ; 116 (30%) were simplified or subsumed later,
% 0.55/0.73 ; 269 (70%) are still being kept.
% 0.55/0.73 ;
% 0.55/0.73 ; Run time in seconds excluding printing time:
% 0.55/0.73 ; 0.000 0% Read assertion file (1 call)
% 0.55/0.73 ; 0.000 0% Assert (2 calls)
% 0.55/0.73 ; 0.035 10% Process new row (2,753 calls)
% 0.55/0.73 ; 0.001 0% Resolution (124 calls)
% 0.55/0.73 ; 0.040 12% Paramodulation (62 calls)
% 0.55/0.73 ; 0.082 24% Forward simplification (2,612 calls)
% 0.55/0.73 ; 0.020 6% Backward simplification (385 calls)
% 0.55/0.73 ; 0.135 40% Ordering (24,469 calls)
% 0.55/0.73 ; 0.000 0% Sortal reasoning (32 calls)
% 0.55/0.73 ; 0.000 0% Purity testing (1 call)
% 0.55/0.73 ; 0.026 8% Other
% 0.55/0.73 ; 0.339 Total
% 0.55/0.73 ; 0.341 Real time
% 0.55/0.73 ;
% 0.55/0.73 ; Term-hash-array has 1,108 terms in all.
% 0.55/0.73 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.55/0.73 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.55/0.73 ; Path-index has 741 entries (828 at peak, 1,150 added, 409 deleted).
% 0.55/0.73 ; Path-index has 936 nodes (961 at peak, 1,174 added, 238 deleted).
% 0.55/0.73 ; Trie-index has 741 entries (828 at peak, 1,150 added, 409 deleted).
% 0.55/0.73 ; Trie-index has 2,983 nodes (3,431 at peak, 4,279 added, 1,296 deleted).
% 0.55/0.73 ; Retrieved 18,291 generalization terms in 16,667 calls.
% 0.55/0.73 ; Retrieved 3,828 instance terms in 558 calls.
% 0.55/0.73 ; Retrieved 7,196 unifiable terms in 502 calls.
% 0.55/0.73 ;
% 0.55/0.73 ; The agenda of backward simplifiable rows to process has 11 entries:
% 0.55/0.73 ; 11 with value 0
% 0.55/0.73 ; The agenda of rows to process has 87 entries:
% 0.55/0.73 ; 2 with value 24 12 with value 28 13 with value 32
% 0.55/0.73 ; 3 with value 25 14 with value 29 6 with value 33
% 0.55/0.73 ; 9 with value 26 5 with value 30 9 with value 34
% 0.55/0.73 ; 6 with value 27 7 with value 31 1 with value 35
% 0.55/0.73 ; The agenda of rows to give has 227 entries:
% 0.55/0.73 ; 4 with value (4 24) 38 with value (4 30) 15 with value (4 35)
% 0.55/0.73 ; 1 with value (4 26) 19 with value (4 31) 33 with value (4 36)
% 0.55/0.73 ; 5 with value (4 27) 32 with value (4 32) 22 with value (4 37)
% 0.55/0.73 ; 3 with value (4 28) 30 with value (4 33) 2 with value (4 38)
% 0.55/0.73 ; 15 with value (4 29) 8 with value (4 34)
% 0.55/0.73 Evaluation took:
% 0.55/0.73 0.342 seconds of real time
% 0.55/0.73 0.294891 seconds of user run time
% 0.55/0.73 0.04686 seconds of system run time
% 0.55/0.73 [Run times include 0.007 seconds GC run time.]
% 0.55/0.73 0 calls to %EVAL
% 0.55/0.73 0 page faults and
% 0.55/0.73 21,481,208 bytes consed.
% 0.55/0.73 :PROOF-FOUND
% 0.55/0.73 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T22:03:27
% 0.55/0.73 :PROOF-FOUND
% 0.55/0.73 *
%------------------------------------------------------------------------------