TSTP Solution File: GRP184-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:24 EDT 2022
% Result : Unsatisfiable 0.22s 0.59s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 4 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 23 ( 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(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_glb1,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
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(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p21_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_1) ).
cnf(p21_2,hypothesis,
inverse(inverse(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_2) ).
cnf(p21_3,hypothesis,
inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21_3) ).
cnf(prove_p21,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p21) ).
cnf(20,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity))) != least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)),
inference('REWRITE',[status(thm)],[prove_p21,monotony_lub1,left_identity,monotony_lub2,theory(equality)]) ).
cnf(21,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,p21_2,theory(equality)]) ).
cnf(59,plain,
inverse(X) = multiply(inverse(X),identity),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[p21_3,p21_1,theory(equality)]),left_identity,theory(equality)]) ).
cnf(60,plain,
least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity))) != least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),inverse(greatest_lower_bound(a,identity))),
inference('REWRITE',[status(thm)],[20,59,theory(equality)]) ).
cnf(61,plain,
inverse(multiply(X,inverse(Y))) = multiply(Y,inverse(X)),
inference('PARAMODULATE',[status(thm)],[p21_3,p21_2,theory(equality)]) ).
cnf(62,plain,
least_upper_bound(inverse(greatest_lower_bound(identity,inverse(a))),inverse(greatest_lower_bound(a,identity))) != least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),inverse(greatest_lower_bound(a,identity))),
inference('REWRITE',[status(thm)],[60,left_identity,21,monotony_glb2,61,theory(equality)]) ).
cnf(63,plain,
inverse(multiply(inverse(X),Y)) = multiply(inverse(Y),X),
inference('PARAMODULATE',[status(thm)],[p21_3,p21_2,theory(equality)]) ).
cnf(64,plain,
$false,
inference('REWRITE',[status(thm)],[62,59,left_inverse,monotony_glb1,63,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 09:08:18 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.51 #<PACKAGE "SNARK-USER">
% 0.22/0.51 *
% 0.22/0.51 SNARK-TPTP-OPTIONS
% 0.22/0.51 *
% 0.22/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.51 (USE-FACTORING :POS)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.51 *
% 0.22/0.51 "."
% 0.22/0.51 *
% 0.22/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:08:18
% 0.22/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T09:08:18
% 0.22/0.52
% 0.22/0.52 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.22/0.52 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.22/0.52 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.22/0.52 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.22/0.52 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.22/0.52 ; Declaring greatest_lower_bound to be commutative.
% 0.22/0.52 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.22/0.52 ; Declaring least_upper_bound to be commutative.
% 0.22/0.59 ; Declaring least_upper_bound to be associative-commutative.
% 0.22/0.59
% 0.22/0.59 #||
% 0.22/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.59 % SZS output start Refutation
% See solution above
% 0.22/0.59 ||#
% 0.22/0.59
% 0.22/0.59 ; Summary of computation:
% 0.22/0.59 ; 273 formulas have been input or derived (from 14 formulas).
% 0.22/0.59 ; 64 (23%) were retained. Of these,
% 0.22/0.59 ; 4 ( 6%) were simplified or subsumed later,
% 0.22/0.59 ; 60 (94%) are still being kept.
% 0.22/0.59 ;
% 0.22/0.59 ; Run time in seconds excluding printing time:
% 0.22/0.59 ; 0.004 5% Read assertion file (1 call)
% 0.22/0.59 ; 0.001 1% Assert (19 calls)
% 0.22/0.59 ; 0.009 11% Process new row (262 calls)
% 0.22/0.59 ; 0.000 0% Resolution (26 calls)
% 0.22/0.59 ; 0.007 8% Paramodulation (13 calls)
% 0.22/0.59 ; 0.002 2% Embedding (26 calls)
% 0.22/0.59 ; 0.027 33% Forward simplification (240 calls)
% 0.22/0.59 ; 0.003 4% Backward simplification (41 calls)
% 0.22/0.59 ; 0.002 2% Ordering (177 calls)
% 0.22/0.59 ; 0.002 2% Ordering ac (60 calls)
% 0.22/0.59 ; 0.000 0% Sortal reasoning (32 calls)
% 0.22/0.59 ; 0.000 0% Purity testing (1 call)
% 0.22/0.59 ; 0.026 31% Other
% 0.22/0.59 ; 0.083 Total
% 0.22/0.59 ; 0.086 Real time
% 0.22/0.59 ;
% 0.22/0.59 ; Term-hash-array has 203 terms in all.
% 0.22/0.59 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.22/0.59 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.22/0.59 ; Path-index has 190 entries (199 at peak, 217 added, 27 deleted).
% 0.22/0.59 ; Path-index has 173 nodes (195 at peak, 252 added, 79 deleted).
% 0.22/0.59 ; Trie-index has 190 entries (199 at peak, 217 added, 27 deleted).
% 0.22/0.59 ; Trie-index has 121 nodes (125 at peak, 141 added, 20 deleted).
% 0.22/0.59 ; Retrieved 5,354 generalization terms in 1,321 calls.
% 0.22/0.59 ; Retrieved 186 instance terms in 46 calls.
% 0.22/0.59 ; Retrieved 167 unifiable terms in 60 calls.
% 0.22/0.59 ;
% 0.22/0.59 ; The agenda of input rows to give has 5 entries:
% 0.22/0.59 ; 1 with value 14 4 with value 16
% 0.22/0.59 ; The agenda of rows to give has 41 entries:
% 0.22/0.59 ; 1 with value (4 10) 4 with value (4 21) 4 with value (4 27)
% 0.22/0.59 ; 2 with value (4 11) 4 with value (4 22) 4 with value (4 30)
% 0.22/0.59 ; 2 with value (4 15) 4 with value (4 24) 4 with value (4 31)
% 0.22/0.59 ; 4 with value (4 20) 4 with value (4 25) 4 with value (4 33)
% 0.22/0.59 Evaluation took:
% 0.22/0.59 0.086 seconds of real time
% 0.22/0.59 0.079187 seconds of user run time
% 0.22/0.59 0.006297 seconds of system run time
% 0.22/0.59 0 calls to %EVAL
% 0.22/0.59 0 page faults and
% 0.22/0.59 5,609,832 bytes consed.
% 0.22/0.59 :PROOF-FOUND
% 0.22/0.59 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T09:08:18
% 0.22/0.59 :PROOF-FOUND
% 0.22/0.59 *
%------------------------------------------------------------------------------