TSTP Solution File: GRP175-2 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP175-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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:18 EDT 2022
% Result : Unsatisfiable 16.89s 17.05s
% Output : Refutation 16.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 9 equ; 1 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 : 12 ( 0 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(monotony_glb1,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(p06b_1,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p06b_1) ).
cnf(prove_p06b,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p06b) ).
cnf(93,plain,
X = greatest_lower_bound(X,multiply(b,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,p06b_1,theory(equality)]),left_identity,theory(equality)]) ).
cnf(131,plain,
multiply(X,Y) = greatest_lower_bound(multiply(X,Y),multiply(X,multiply(b,Y))),
inference('PARAMODULATE',[status(thm)],[monotony_glb1,93,theory(equality)]) ).
cnf(3198,plain,
identity = greatest_lower_bound(identity,multiply(inverse(X),multiply(b,X))),
inference('PARAMODULATE',[status(thm)],[131,left_inverse,theory(equality)]) ).
cnf(3200,plain,
$false,
inference('REWRITE',[status(thm)],[prove_p06b,3198,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP175-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.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 14:12:42 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-13T14:12:42
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-13T14:12:42
% 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.
% 16.89/17.05 ; Declaring least_upper_bound to be associative-commutative.
% 16.89/17.05
% 16.89/17.05 #||
% 16.89/17.05 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.89/17.05 % SZS output start Refutation
% See solution above
% 16.89/17.06 ||#
% 16.89/17.06
% 16.89/17.06 ; Summary of computation:
% 16.89/17.06 ; 19568 formulas have been input or derived (from 139 formulas).
% 16.89/17.06 ; 3200 (16%) were retained. Of these,
% 16.89/17.06 ; 213 ( 7%) were simplified or subsumed later,
% 16.89/17.06 ; 2987 (93%) are still being kept.
% 16.89/17.06 ;
% 16.89/17.06 ; Run time in seconds excluding printing time:
% 16.89/17.06 ; 0.004 0% Read assertion file (1 call)
% 16.89/17.06 ; 0.001 0% Assert (17 calls)
% 16.89/17.06 ; 0.504 3% Process new row (19,048 calls)
% 16.89/17.06 ; 0.014 0% Resolution (276 calls)
% 16.89/17.06 ; 0.354 2% Paramodulation (138 calls)
% 16.89/17.06 ; 0.041 0% Embedding (1,579 calls)
% 16.89/17.06 ; 15.047 91% Forward simplification (17,398 calls)
% 16.89/17.06 ; 0.152 1% Backward simplification (1,625 calls)
% 16.89/17.06 ; 0.272 2% Ordering (73,109 calls)
% 16.89/17.06 ; 0.088 1% Ordering ac (8,268 calls)
% 16.89/17.06 ; 0.000 0% Sortal reasoning (32 calls)
% 16.89/17.06 ; 0.000 0% Purity testing (1 call)
% 16.89/17.06 ; 0.094 1% Other
% 16.89/17.06 ; 16.571 Total
% 16.89/17.06 ; 16.578 Real time
% 16.89/17.06 ;
% 16.89/17.06 ; Term-hash-array has 8,580 terms in all.
% 16.89/17.06 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 16.89/17.06 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 16.89/17.06 ; Path-index has 8,067 entries (8,071 at peak, 8,623 added, 556 deleted).
% 16.89/17.06 ; Path-index has 1,531 nodes (1,540 at peak, 1,573 added, 42 deleted).
% 16.89/17.06 ; Trie-index has 8,067 entries (8,071 at peak, 8,623 added, 556 deleted).
% 16.89/17.06 ; Trie-index has 882 nodes (889 at peak, 1,026 added, 144 deleted).
% 16.89/17.06 ; Retrieved 36,564,571 generalization terms in 224,006 calls.
% 16.89/17.06 ; Retrieved 14,046 instance terms in 1,659 calls.
% 16.89/17.06 ; Retrieved 92,554 unifiable terms in 774 calls.
% 16.89/17.06 ;
% 16.89/17.06 ; The agenda of rows to process has 36 entries:
% 16.89/17.06 ; 2 with value 17 4 with value 22 2 with value 28
% 16.89/17.06 ; 1 with value 18 1 with value 23 2 with value 29
% 16.89/17.06 ; 1 with value 19 1 with value 25 3 with value 30
% 16.89/17.06 ; 3 with value 20 3 with value 26 3 with value 31
% 16.89/17.06 ; 2 with value 21 8 with value 27
% 16.89/17.06 ; The agenda of rows to give has 2852 entries:
% 16.89/17.06 ; 2 with value (4 17) 114 with value (4 35) 24 with value (4 51)
% 16.89/17.06 ; 37 with value (4 19) 58 with value (4 36) 10 with value (4 52)
% 16.89/17.06 ; 54 with value (4 20) 68 with value (4 37) 40 with value (4 53)
% 16.89/17.06 ; 98 with value (4 21) 90 with value (4 38) 20 with value (4 54)
% 16.89/17.06 ; 115 with value (4 22) 62 with value (4 39) 10 with value (4 55)
% 16.89/17.06 ; 117 with value (4 23) 66 with value (4 40) 18 with value (4 56)
% 16.89/17.06 ; 138 with value (4 24) 54 with value (4 41) 2 with value (4 57)
% 16.89/17.06 ; 114 with value (4 25) 54 with value (4 42) 10 with value (4 58)
% 16.89/17.06 ; 179 with value (4 26) 60 with value (4 43) 2 with value (4 59)
% 16.89/17.06 ; 150 with value (4 27) 46 with value (4 44) 6 with value (4 60)
% 16.89/17.06 ; 152 with value (4 28) 40 with value (4 45) 8 with value (4 63)
% 16.89/17.06 ; 112 with value (4 29) 38 with value (4 46) 4 with value (4 64)
% 16.89/17.06 ; 118 with value (4 30) 18 with value (4 47) 8 with value (4 65)
% 16.89/17.06 ; 94 with value (4 31) 32 with value (4 48) 4 with value (4 66)
% 16.89/17.06 ; 126 with value (4 32) 6 with value (4 49) 4 with value (4 68)
% 16.89/17.06 ; 134 with value (4 33) 16 with value (4 50) 4 with value (4 70)
% 16.89/17.06 ; 116 with value (4 34)
% 16.89/17.06 Evaluation took:
% 16.89/17.06 16.579 seconds of real time
% 16.89/17.06 16.334314 seconds of user run time
% 16.89/17.06 0.243761 seconds of system run time
% 16.89/17.06 [Run times include 0.407 seconds GC run time.]
% 16.89/17.06 0 calls to %EVAL
% 16.89/17.06 0 page faults and
% 16.89/17.06 957,828,304 bytes consed.
% 16.89/17.06 :PROOF-FOUND
% 16.89/17.06 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T14:12:59
% 16.89/17.06 :PROOF-FOUND
% 16.89/17.06 *
%------------------------------------------------------------------------------