TSTP Solution File: GRP191-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n012.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 4.18s 4.39s
% Output : Refutation 4.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 6 RR)
% Number of literals : 23 ( 22 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 : 30 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(p39b_1,hypothesis,
greatest_lower_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39b_1) ).
cnf(prove_p39b,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39b) ).
cnf(19,plain,
least_upper_bound(a,b) = a,
inference('PARAMODULATE',[status(thm)],[lub_absorbtion,p39b_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,
inverse(b) = least_upper_bound(inverse(b),inverse(a)),
inference('PARAMODULATE',[status(thm)],[294,148,theory(equality)]) ).
cnf(1420,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[glb_absorbtion,1392,theory(equality)]),prove_p39b]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n012.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 23:08:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:08:40
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-13T23:08:40
% 0.20/0.49
% 0.20/0.49 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.49 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.20/0.49 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.20/0.49 ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.20/0.49 ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.20/0.49 ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.20/0.49 ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.20/0.49 ; Declaring greatest_lower_bound to be commutative.
% 0.20/0.49 ; Declaring greatest_lower_bound to be associative-commutative.
% 0.20/0.49 ; Declaring least_upper_bound to be commutative.
% 4.18/4.39 ; Declaring least_upper_bound to be associative-commutative.
% 4.18/4.39
% 4.18/4.39 #||
% 4.18/4.39 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.18/4.39 % SZS output start Refutation
% See solution above
% 4.18/4.39 ||#
% 4.18/4.39
% 4.18/4.39 ; Summary of computation:
% 4.18/4.39 ; 8246 formulas have been input or derived (from 102 formulas).
% 4.18/4.39 ; 1420 (17%) were retained. Of these,
% 4.18/4.39 ; 90 ( 6%) were simplified or subsumed later,
% 4.18/4.39 ; 1330 (94%) are still being kept.
% 4.18/4.39 ;
% 4.18/4.39 ; Run time in seconds excluding printing time:
% 4.18/4.39 ; 0.004 0% Read assertion file (1 call)
% 4.18/4.39 ; 0.000 0% Assert (17 calls)
% 4.18/4.39 ; 0.208 5% Process new row (8,024 calls)
% 4.18/4.39 ; 0.004 0% Resolution (202 calls)
% 4.18/4.39 ; 0.174 4% Paramodulation (101 calls)
% 4.18/4.39 ; 0.016 0% Embedding (689 calls)
% 4.18/4.39 ; 3.300 85% Forward simplification (7,271 calls)
% 4.18/4.39 ; 0.031 1% Backward simplification (735 calls)
% 4.18/4.39 ; 0.075 2% Ordering (18,402 calls)
% 4.18/4.39 ; 0.028 1% Ordering ac (3,291 calls)
% 4.18/4.39 ; 0.000 0% Sortal reasoning (32 calls)
% 4.18/4.39 ; 0.000 0% Purity testing (1 call)
% 4.18/4.39 ; 0.058 1% Other
% 4.18/4.39 ; 3.898 Total
% 4.18/4.39 ; 3.908 Real time
% 4.18/4.39 ;
% 4.18/4.39 ; Term-hash-array has 4,061 terms in all.
% 4.18/4.39 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 4.18/4.39 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 4.18/4.39 ; Path-index has 3,835 entries (3,835 at peak, 4,074 added, 239 deleted).
% 4.18/4.39 ; Path-index has 1,537 nodes (1,537 at peak, 1,583 added, 46 deleted).
% 4.18/4.39 ; Trie-index has 3,835 entries (3,835 at peak, 4,074 added, 239 deleted).
% 4.18/4.39 ; Trie-index has 870 nodes (870 at peak, 1,006 added, 136 deleted).
% 4.18/4.39 ; Retrieved 7,471,771 generalization terms in 84,642 calls.
% 4.18/4.39 ; Retrieved 3,909 instance terms in 769 calls.
% 4.18/4.39 ; Retrieved 37,037 unifiable terms in 606 calls.
% 4.18/4.39 ;
% 4.18/4.39 ; The agenda of rows to process has 2 entries:
% 4.18/4.39 ; 2 with value 24
% 4.18/4.39 ; The agenda of rows to give has 1235 entries:
% 4.18/4.39 ; 1 with value (4 16) 96 with value (4 29) 18 with value (4 40)
% 4.18/4.39 ; 13 with value (4 19) 66 with value (4 30) 8 with value (4 41)
% 4.18/4.39 ; 30 with value (4 20) 58 with value (4 31) 8 with value (4 42)
% 4.18/4.39 ; 22 with value (4 21) 98 with value (4 32) 8 with value (4 43)
% 4.18/4.39 ; 41 with value (4 22) 60 with value (4 33) 12 with value (4 44)
% 4.18/4.39 ; 55 with value (4 23) 54 with value (4 34) 6 with value (4 45)
% 4.18/4.39 ; 74 with value (4 24) 38 with value (4 35) 2 with value (4 46)
% 4.18/4.39 ; 72 with value (4 25) 36 with value (4 36) 2 with value (4 50)
% 4.18/4.39 ; 95 with value (4 26) 24 with value (4 37) 2 with value (4 51)
% 4.18/4.39 ; 100 with value (4 27) 28 with value (4 38) 4 with value (4 52)
% 4.18/4.39 ; 76 with value (4 28) 26 with value (4 39) 2 with value (4 54)
% 4.18/4.39 Evaluation took:
% 4.18/4.39 3.909 seconds of real time
% 4.18/4.39 3.827439 seconds of user run time
% 4.18/4.39 0.072988 seconds of system run time
% 4.18/4.39 [Run times include 0.082 seconds GC run time.]
% 4.18/4.39 0 calls to %EVAL
% 4.18/4.39 0 page faults and
% 4.18/4.39 184,297,776 bytes consed.
% 4.18/4.39 :PROOF-FOUND
% 4.18/4.39 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:08:44
% 4.18/4.39 :PROOF-FOUND
% 4.18/4.39 *
%------------------------------------------------------------------------------