TSTP Solution File: GRP186-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:37:26 EDT 2022
% Result : Unsatisfiable 0.38s 0.62s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 14 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(prove_p23x,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p23x) ).
cnf(17,plain,
least_upper_bound(multiply(a,b),identity) != least_upper_bound(multiply(a,inverse(a)),multiply(a,b)),
inference('REWRITE',[status(thm)],[prove_p23x,monotony_lub1,theory(equality)]) ).
cnf(55,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(56,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(83,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[55,left_inverse,theory(equality)]) ).
cnf(84,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[55,55,theory(equality)]) ).
cnf(85,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[83,84,theory(equality)]) ).
cnf(86,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[56,85,theory(equality)]) ).
cnf(94,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[86,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(100,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,94,theory(equality)]) ).
cnf(101,plain,
$false,
inference('REWRITE',[status(thm)],[17,100,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n013.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 04:02:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.48 #<PACKAGE "SNARK-USER">
% 0.19/0.48 *
% 0.19/0.48 SNARK-TPTP-OPTIONS
% 0.19/0.48 *
% 0.19/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48 (USE-FACTORING :POS)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48 *
% 0.19/0.48 "."
% 0.19/0.48 *
% 0.19/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:02:14
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-13T04:02:14
% 0.19/0.49
% 0.19/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.49 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.49 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.49 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.49 ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.49 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.49 ; Declaring least_upper_bound to be commutative.
% 0.38/0.62 ; Declaring least_upper_bound to be associative-commutative.
% 0.38/0.62
% 0.38/0.62 #||
% 0.38/0.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.62 % SZS output start Refutation
% See solution above
% 0.38/0.62 ||#
% 0.38/0.62
% 0.38/0.62 ; Summary of computation:
% 0.38/0.62 ; 560 formulas have been input or derived (from 22 formulas).
% 0.38/0.62 ; 101 (18%) were retained. Of these,
% 0.38/0.62 ; 7 ( 7%) were simplified or subsumed later,
% 0.38/0.62 ; 94 (93%) are still being kept.
% 0.38/0.62 ;
% 0.38/0.62 ; Run time in seconds excluding printing time:
% 0.38/0.62 ; 0.004 3% Read assertion file (1 call)
% 0.38/0.62 ; 0.001 1% Assert (16 calls)
% 0.38/0.62 ; 0.010 7% Process new row (547 calls)
% 0.38/0.62 ; 0.000 0% Resolution (42 calls)
% 0.38/0.62 ; 0.018 13% Paramodulation (21 calls)
% 0.38/0.62 ; 0.003 2% Embedding (40 calls)
% 0.38/0.62 ; 0.072 51% Forward simplification (511 calls)
% 0.38/0.62 ; 0.004 3% Backward simplification (64 calls)
% 0.38/0.62 ; 0.002 1% Ordering (555 calls)
% 0.38/0.62 ; 0.004 3% Ordering ac (136 calls)
% 0.38/0.62 ; 0.000 0% Sortal reasoning (32 calls)
% 0.38/0.62 ; 0.000 0% Purity testing (1 call)
% 0.38/0.62 ; 0.024 17% Other
% 0.38/0.62 ; 0.142 Total
% 0.38/0.62 ; 0.144 Real time
% 0.38/0.62 ;
% 0.38/0.62 ; Term-hash-array has 341 terms in all.
% 0.38/0.62 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.38/0.62 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.38/0.62 ; Path-index has 329 entries (335 at peak, 348 added, 19 deleted).
% 0.38/0.62 ; Path-index has 317 nodes (327 at peak, 338 added, 21 deleted).
% 0.38/0.62 ; Trie-index has 329 entries (335 at peak, 348 added, 19 deleted).
% 0.38/0.62 ; Trie-index has 220 nodes (225 at peak, 262 added, 42 deleted).
% 0.38/0.62 ; Retrieved 31,859 generalization terms in 5,439 calls.
% 0.38/0.62 ; Retrieved 260 instance terms in 87 calls.
% 0.38/0.62 ; Retrieved 472 unifiable terms in 109 calls.
% 0.38/0.62 ;
% 0.38/0.62 ; The agenda of rows to process has 2 entries:
% 0.38/0.62 ; 1 with value 14 1 with value 15
% 0.38/0.62 ; The agenda of rows to give has 73 entries:
% 0.38/0.62 ; 1 with value (4 12) 4 with value (4 22) 12 with value (4 28)
% 0.38/0.62 ; 1 with value (4 16) 4 with value (4 24) 4 with value (4 30)
% 0.38/0.62 ; 2 with value (4 18) 4 with value (4 25) 4 with value (4 31)
% 0.38/0.62 ; 9 with value (4 20) 4 with value (4 26) 4 with value (4 33)
% 0.38/0.62 ; 8 with value (4 21) 8 with value (4 27) 4 with value (4 36)
% 0.38/0.62 Evaluation took:
% 0.38/0.62 0.144 seconds of real time
% 0.38/0.62 0.127876 seconds of user run time
% 0.38/0.62 0.016736 seconds of system run time
% 0.38/0.62 0 calls to %EVAL
% 0.38/0.62 0 page faults and
% 0.38/0.62 8,513,648 bytes consed.
% 0.38/0.62 :PROOF-FOUND
% 0.38/0.62 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T04:02:14
% 0.38/0.62 :PROOF-FOUND
% 0.38/0.62 *
%------------------------------------------------------------------------------