TSTP Solution File: GRP191-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP191-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:28 EDT 2022
% Result : Unsatisfiable 3.94s 4.13s
% Output : Refutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 1 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(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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(monotony_lub2,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(p39d_1,hypothesis,
greatest_lower_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p39d_1) ).
cnf(prove_p39d,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p39d) ).
cnf(19,plain,
least_upper_bound(a,b) = a,
inference('PARAMODULATE',[status(thm)],[lub_absorbtion,p39d_1,theory(equality)]) ).
cnf(68,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(69,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(101,plain,
multiply(X,a) = least_upper_bound(multiply(X,a),multiply(X,b)),
inference('PARAMODULATE',[status(thm)],[monotony_lub1,19,theory(equality)]) ).
cnf(130,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[68,left_inverse,theory(equality)]) ).
cnf(131,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[68,68,theory(equality)]) ).
cnf(132,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[130,131,theory(equality)]) ).
cnf(133,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[69,132,theory(equality)]) ).
cnf(141,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[133,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(148,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[133,141,theory(equality)]) ).
cnf(280,plain,
identity = least_upper_bound(identity,multiply(inverse(a),b)),
inference('PARAMODULATE',[status(thm)],[101,left_inverse,theory(equality)]) ).
cnf(294,plain,
X = least_upper_bound(X,multiply(multiply(inverse(a),b),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_lub2,280,theory(equality)]),left_identity,theory(equality)]) ).
cnf(1392,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[294,148,theory(equality)]),prove_p39d]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP191-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n014.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 : Tue Jun 14 00:01:07 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.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (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-14T00:01:07
% 0.19/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T00:01:07
% 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.
% 3.94/4.13 ; Declaring least_upper_bound to be associative-commutative.
% 3.94/4.13
% 3.94/4.13 #||
% 3.94/4.13 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.94/4.13 % SZS output start Refutation
% See solution above
% 3.97/4.14 ||#
% 3.97/4.14
% 3.97/4.14 ; Summary of computation:
% 3.97/4.14 ; 8225 formulas have been input or derived (from 101 formulas).
% 3.97/4.14 ; 1392 (17%) were retained. Of these,
% 3.97/4.14 ; 90 ( 6%) were simplified or subsumed later,
% 3.97/4.14 ; 1302 (94%) are still being kept.
% 3.97/4.14 ;
% 3.97/4.14 ; Run time in seconds excluding printing time:
% 3.97/4.14 ; 0.004 0% Read assertion file (1 call)
% 3.97/4.14 ; 0.001 0% Assert (17 calls)
% 3.97/4.14 ; 0.192 5% Process new row (7,927 calls)
% 3.97/4.14 ; 0.006 0% Resolution (200 calls)
% 3.97/4.14 ; 0.162 4% Paramodulation (100 calls)
% 3.97/4.14 ; 0.020 1% Embedding (675 calls)
% 3.97/4.14 ; 3.095 85% Forward simplification (7,188 calls)
% 3.97/4.14 ; 0.045 1% Backward simplification (721 calls)
% 3.97/4.14 ; 0.060 2% Ordering (17,879 calls)
% 3.97/4.14 ; 0.024 1% Ordering ac (3,224 calls)
% 3.97/4.14 ; 0.000 0% Sortal reasoning (32 calls)
% 3.97/4.14 ; 0.000 0% Purity testing (1 call)
% 3.97/4.14 ; 0.050 1% Other
% 3.97/4.14 ; 3.659 Total
% 3.97/4.14 ; 3.661 Real time
% 3.97/4.14 ;
% 3.97/4.14 ; Term-hash-array has 3,982 terms in all.
% 3.97/4.14 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.97/4.14 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.97/4.14 ; Path-index has 3,756 entries (3,756 at peak, 3,995 added, 239 deleted).
% 3.97/4.14 ; Path-index has 1,480 nodes (1,480 at peak, 1,526 added, 46 deleted).
% 3.97/4.14 ; Trie-index has 3,756 entries (3,756 at peak, 3,995 added, 239 deleted).
% 3.97/4.14 ; Trie-index has 847 nodes (847 at peak, 983 added, 136 deleted).
% 3.97/4.14 ; Retrieved 7,346,328 generalization terms in 83,610 calls.
% 3.97/4.14 ; Retrieved 3,891 instance terms in 755 calls.
% 3.97/4.14 ; Retrieved 35,879 unifiable terms in 598 calls.
% 3.97/4.14 ;
% 3.97/4.14 ; The agenda of rows to process has 80 entries:
% 3.97/4.14 ; 3 with value 17 3 with value 28 1 with value 38
% 3.97/4.14 ; 2 with value 18 4 with value 30 3 with value 39
% 3.97/4.14 ; 4 with value 19 5 with value 31 5 with value 40
% 3.97/4.14 ; 3 with value 21 1 with value 32 2 with value 41
% 3.97/4.14 ; 5 with value 22 1 with value 33 2 with value 42
% 3.97/4.14 ; 2 with value 23 10 with value 34 1 with value 43
% 3.97/4.14 ; 2 with value 24 1 with value 35 1 with value 44
% 3.97/4.14 ; 3 with value 25 4 with value 36 3 with value 45
% 3.97/4.14 ; 5 with value 27 3 with value 37 1 with value 46
% 3.97/4.14 ; The agenda of rows to give has 1208 entries:
% 3.97/4.14 ; 11 with value (4 19) 66 with value (4 30) 18 with value (4 40)
% 3.97/4.14 ; 30 with value (4 20) 58 with value (4 31) 8 with value (4 41)
% 3.97/4.14 ; 22 with value (4 21) 92 with value (4 32) 8 with value (4 42)
% 3.97/4.14 ; 41 with value (4 22) 60 with value (4 33) 8 with value (4 43)
% 3.97/4.14 ; 55 with value (4 23) 54 with value (4 34) 10 with value (4 44)
% 3.97/4.14 ; 72 with value (4 24) 36 with value (4 35) 6 with value (4 45)
% 3.97/4.14 ; 72 with value (4 25) 36 with value (4 36) 2 with value (4 50)
% 3.97/4.14 ; 95 with value (4 26) 24 with value (4 37) 2 with value (4 51)
% 3.97/4.14 ; 96 with value (4 27) 28 with value (4 38) 2 with value (4 52)
% 3.97/4.14 ; 74 with value (4 28) 26 with value (4 39) 2 with value (4 54)
% 3.97/4.14 ; 94 with value (4 29)
% 3.97/4.14 Evaluation took:
% 3.97/4.14 3.662 seconds of real time
% 3.97/4.14 3.580958 seconds of user run time
% 3.97/4.14 0.079987 seconds of system run time
% 3.97/4.14 [Run times include 0.08 seconds GC run time.]
% 3.97/4.14 0 calls to %EVAL
% 3.97/4.14 0 page faults and
% 3.97/4.14 181,544,968 bytes consed.
% 3.97/4.14 :PROOF-FOUND
% 3.97/4.14 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T00:01:10
% 3.97/4.14 :PROOF-FOUND
% 3.97/4.14 *
%------------------------------------------------------------------------------